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 listMay 19, 2026 17:00Victor MerckléVictor MerckléScore: 6,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 17:006,67865,537,24654,412,0001,022,0002,113,536
2May 19, 2026 17:006,68665,357,65654,474,0001,022,0002,113,536
3May 19, 2026 17:006,73163,628,63154,851,0001,017,0002,113,536
4May 19, 2026 17:006,74164,624,52154,934,0001,020,0002,113,536
5May 19, 2026 17:006,76364,633,15455,131,0001,008,0002,113,536
6May 19, 2026 17:006,84665,158,17155,813,0001,016,0002,113,536
7May 19, 2026 17:006,90566,477,54356,197,0001,117,0002,113,536
8May 19, 2026 17:006,94568,599,97756,627,0001,017,0002,113,536
9May 19, 2026 17:007,00466,678,95157,098,0001,036,0002,113,536