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 listJul 5, 2026 21:08Victor MerckléVictor MerckléScore: 5,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 21:095,50053,714,28544,547,0001,107,0002,117,632stderr
2Jul 5, 2026 21:095,50253,738,20844,536,0001,135,0002,117,632stderr
3Jul 5, 2026 21:095,50453,734,21044,565,0001,124,0002,117,632stderr
4Jul 5, 2026 21:095,51253,811,56844,648,0001,104,0002,117,632stderr
5Jul 5, 2026 21:095,51253,786,80944,616,0001,138,0002,117,632stderr
6Jul 5, 2026 21:095,51555,281,69244,759,0001,021,0002,117,632stderr
7Jul 5, 2026 21:095,52553,987,31844,854,0001,007,0002,117,632stderr
8Jul 5, 2026 21:095,54254,128,90944,768,0001,235,0002,117,632stderr
9Jul 5, 2026 21:095,55354,233,78644,906,0001,190,0002,117,632stderr