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 25, 2026 20:47Maya RebholzMaya RebholzScore: 5,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 20:475,80460,303,56843,112,0005,064,0002,117,632
2May 25, 2026 20:475,86159,278,82943,454,0005,196,0002,117,632
3May 25, 2026 20:475,87461,771,62443,190,0005,567,0002,117,632
4May 25, 2026 20:475,88058,237,83743,673,0005,137,0002,117,632
5May 25, 2026 20:475,92261,174,78043,464,0005,691,0002,117,632
6May 25, 2026 20:475,95158,957,26643,873,0005,525,0002,113,536
7May 25, 2026 20:475,97059,524,15643,984,0005,575,0002,117,632
8May 25, 2026 20:475,97661,406,68043,987,0005,614,0002,117,632
9May 25, 2026 20:476,25064,239,38546,128,0005,755,0002,117,632