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 listSep 8, 2026 19:08Victor MerckléVictor MerckléScore: 3,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 19:113,70740,020,19029,750,0001,023,0002,117,632stderr
2Sep 8, 2026 19:113,71340,063,61129,785,0001,034,0002,117,632stderr
3Sep 8, 2026 19:113,71839,205,06529,830,0001,034,0002,117,632stderr
4Sep 8, 2026 19:113,72239,244,94929,868,0001,032,0002,117,632stderr
5Sep 8, 2026 19:113,72540,238,27729,885,0001,039,0002,117,632stderr
6Sep 8, 2026 19:113,72739,281,52629,911,0001,026,0002,117,632stderr
7Sep 8, 2026 19:113,73039,298,50429,936,0001,026,0002,117,632stderr
8Sep 8, 2026 19:113,73239,265,11729,961,0001,022,0002,117,632stderr
9Sep 8, 2026 19:113,73540,259,60129,969,0001,033,0002,117,632stderr