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 19:30Victor MerckléVictor MerckléScore: 5,051Success
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 19:315,03650,954,28640,787,0001,019,0002,117,632stderr
2Aug 28, 2026 19:315,04250,944,49440,829,0001,020,0002,117,632stderr
3Aug 28, 2026 19:315,05050,900,08840,896,0001,019,0002,117,632stderr
4Aug 28, 2026 19:315,05150,822,70840,908,0001,021,0002,117,632stderr
5Aug 28, 2026 19:315,05150,243,61540,885,0001,045,0002,117,632stderr
6Aug 28, 2026 19:315,05250,941,45140,909,0001,024,0002,117,632stderr
7Aug 28, 2026 19:315,05551,057,56040,943,0001,019,0002,117,632stderr
8Aug 28, 2026 19:315,11951,562,25941,458,0001,031,0002,117,632stderr
9Aug 28, 2026 19:315,11951,527,06941,469,0001,019,0002,117,632stderr