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 11, 2026 21:02Victor MerckléVictor MerckléScore: 10,237Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 21:0310,23195,254,07883,830,0001,095,0002,113,536
2May 11, 2026 21:0310,23393,751,57183,852,0001,088,0002,113,536
3May 11, 2026 21:0310,23496,582,92383,857,0001,093,0002,113,536
4May 11, 2026 21:0310,23595,786,05683,859,0001,094,0002,113,536
5May 11, 2026 21:0310,23795,745,48883,859,0001,112,0002,113,536
6May 11, 2026 21:0310,24995,569,34383,901,0001,169,0002,113,536
7May 11, 2026 21:0310,25093,871,25984,055,0001,021,0002,113,536
8May 11, 2026 21:0310,25095,642,80183,897,0001,179,0002,113,536
9May 11, 2026 21:0310,28294,181,68684,164,0001,180,0002,113,536