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 28, 2026 18:28Victor MerckléVictor MerckléScore: 7,069Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 18:297,04267,498,04657,434,0001,016,0002,117,632stderr
2Aug 28, 2026 18:297,04267,446,55957,433,0001,022,0002,117,632stderr
3Aug 28, 2026 18:297,06167,604,80757,602,0001,008,0002,117,632stderr
4Aug 28, 2026 18:297,06367,671,17257,613,0001,014,0002,117,632stderr
5Aug 28, 2026 18:297,06967,697,58457,656,0001,023,0002,117,632stderr
6Aug 28, 2026 18:297,07167,013,51057,681,0001,009,0002,117,632stderr
7Aug 28, 2026 18:297,07367,760,38957,690,0001,017,0002,117,632stderr
8Aug 28, 2026 18:297,07467,759,05357,704,0001,014,0002,117,632stderr
9Aug 28, 2026 18:297,08367,776,46957,784,0001,010,0002,117,632stderr