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 27, 2026 11:18Victor MerckléVictor MerckléScore: 3,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 11:193,78539,780,43330,293,0001,130,0002,117,632stderr
2Aug 27, 2026 11:193,81640,067,17330,607,0001,070,0002,117,632stderr
3Aug 27, 2026 11:193,81740,098,44730,540,0001,149,0002,117,632stderr
4Aug 27, 2026 11:193,82340,137,68830,620,0001,119,0002,117,632stderr
5Aug 27, 2026 11:193,83040,125,70930,698,0001,094,0002,117,632stderr
6Aug 27, 2026 11:193,83348,691,83530,627,0001,195,0002,117,632stderr
7Aug 27, 2026 11:193,89340,681,56731,253,0001,060,0002,117,632stderr
8Aug 27, 2026 11:193,92540,938,93931,498,0001,080,0002,117,632stderr
9Aug 27, 2026 11:193,92950,928,19831,450,0001,165,0002,117,632stderr