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 01:26Victor MerckléVictor MerckléScore: 7,818Success
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 01:277,16467,796,71958,390,0001,074,0002,117,632stderr
2Aug 25, 2026 01:277,19168,815,46458,544,0001,145,0002,117,632stderr
3Aug 25, 2026 01:277,19768,084,29758,629,0001,112,0002,117,632stderr
4Aug 25, 2026 01:277,24868,513,11959,027,0001,134,0002,117,632stderr
5Aug 25, 2026 01:277,81873,243,47763,754,0001,138,0002,117,632stderr
6Aug 25, 2026 01:277,85573,563,19964,108,0001,095,0002,117,632stderr
7Aug 25, 2026 01:277,85673,615,58564,060,0001,152,0002,117,632stderr
8Aug 25, 2026 01:277,85773,591,95364,084,0001,134,0002,117,632stderr
9Aug 25, 2026 01:279,62888,283,04378,809,0001,109,0002,117,632stderr