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 15:53boop34boop34Score: 9,011Success
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 15:538,97684,310,17973,281,0001,222,0002,113,536
2Aug 25, 2026 15:538,98684,527,67773,387,0001,203,0002,113,536
3Aug 25, 2026 15:539,00584,597,46073,620,0001,128,0002,113,536
4Aug 25, 2026 15:539,00984,625,17573,550,0001,226,0002,113,536
5Aug 25, 2026 15:539,01184,692,82573,586,0001,207,0002,113,536
6Aug 25, 2026 15:539,01484,677,97273,615,0001,209,0002,113,536
7Aug 25, 2026 15:539,01784,653,84073,736,0001,109,0002,113,536
8Aug 25, 2026 15:539,03784,791,41773,903,0001,108,0002,113,536
9Aug 25, 2026 15:539,09185,440,33174,357,0001,104,0002,113,536