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 listMay 24, 2026 20:04Victor MerckléVictor MerckléScore: 5,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 20:055,10051,715,86341,251,0001,083,0002,113,536
2May 24, 2026 20:055,10451,260,00641,293,0001,078,0002,113,536
3May 24, 2026 20:055,10752,087,57841,313,0001,076,0002,113,536
4May 24, 2026 20:055,11050,262,94941,341,0001,076,0002,113,536
5May 24, 2026 20:055,12751,052,82941,487,0001,073,0002,113,536
6May 24, 2026 20:055,13451,751,87541,614,0001,002,0002,113,536
7May 24, 2026 20:055,13750,436,07541,570,0001,075,0002,113,536
8May 24, 2026 20:055,20852,136,73242,152,0001,080,0002,113,536
9May 24, 2026 20:055,41054,936,74643,860,0001,046,0002,113,536