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 24, 2026 19:59Maya RebholzMaya RebholzScore: 7,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 20:007,28472,889,05754,807,0005,651,0002,113,536
2May 24, 2026 20:007,32973,045,63255,327,0005,511,0002,117,632
3May 24, 2026 20:007,35472,578,03155,487,0005,556,0002,113,536
4May 24, 2026 20:007,37871,142,20955,543,0005,700,0002,113,536
5May 24, 2026 20:007,41571,642,34656,048,0005,501,0002,117,632
6May 24, 2026 20:007,42778,865,76855,913,0005,737,0002,113,536
7May 24, 2026 20:007,48776,737,14554,964,0007,182,0002,113,536
8May 24, 2026 20:007,52679,626,28956,826,0005,648,0002,117,632
9May 24, 2026 20:007,98182,941,64458,387,0007,856,0002,113,536