Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listFeb 1, 2025 20:55E SequeiraE SequeiraScore: 77,063Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 20:5576,912665,327,092578,332,00060,034,0002,498,560
2Feb 1, 2025 20:5577,063660,624,940580,659,00058,965,0002,502,656
3Feb 1, 2025 20:5577,431672,946,421573,817,00068,858,0002,494,464