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 02:18Victor MerckléVictor MerckléScore: 8,730Success
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 02:198,69081,068,64071,010,0001,124,0002,117,632stderr
2Aug 25, 2026 02:198,70881,851,32271,197,0001,080,0002,117,632stderr
3Aug 25, 2026 02:198,71680,753,28371,268,0001,083,0002,117,632stderr
4Aug 25, 2026 02:198,71980,854,16671,308,0001,062,0002,117,632stderr
5Aug 25, 2026 02:198,73080,876,80671,380,0001,084,0002,117,632stderr
6Aug 25, 2026 02:198,93183,171,00173,007,0001,128,0002,117,632stderr
7Aug 25, 2026 02:198,95382,699,20473,217,0001,093,0002,117,632stderr
8Aug 25, 2026 02:199,05883,599,94074,035,0001,151,0002,117,632stderr
9Aug 25, 2026 02:199,16884,552,01274,980,0001,120,0002,117,632stderr