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 10, 2026 03:17Josu San MartinJosu San MartinScore: 4,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 03:174,65053,076,93337,436,0001,159,0002,473,984
2May 10, 2026 03:174,72852,595,23138,086,0001,161,0002,473,984
3May 10, 2026 03:174,73454,385,29538,131,0001,169,0002,457,600
4May 10, 2026 03:174,74254,270,16338,205,0001,161,0002,473,984
5May 10, 2026 03:174,78657,881,40238,515,0001,212,0002,478,080
6May 10, 2026 03:174,79853,027,16238,661,0001,165,0002,465,792
7May 10, 2026 03:174,84454,576,53539,014,0001,193,0002,469,888
8May 10, 2026 03:175,00358,208,01640,305,0001,220,0002,469,888
9May 10, 2026 03:178,39486,861,41368,475,0001,200,0002,465,792