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 listAug 25, 2026 10:36Victor MerckléVictor MerckléScore: 3,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 10:373,77339,687,84930,195,0001,127,0002,117,632stderr
2Aug 25, 2026 10:373,78039,772,02630,226,0001,154,0002,117,632stderr
3Aug 25, 2026 10:373,78539,813,62830,296,0001,124,0002,117,632stderr
4Aug 25, 2026 10:373,78940,616,92430,343,0001,113,0002,117,632stderr
5Aug 25, 2026 10:373,81840,054,80530,600,0001,091,0002,117,632stderr
6Aug 25, 2026 10:373,82640,149,60530,687,0001,076,0002,117,632stderr
7Aug 25, 2026 10:373,83940,200,55330,797,0001,070,0002,117,632stderr
8Aug 25, 2026 10:373,84240,199,45230,782,0001,107,0002,117,632stderr
9Aug 25, 2026 10:373,90940,823,68831,369,0001,083,0002,117,632stderr