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 listJan 2, 2026 04:15Josu San MartinJosu San MartinScore: 7,490Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 04:157,41586,995,20560,534,0001,008,0002,420,736
2Jan 2, 2026 04:157,44288,198,28861,771,00002,306,048
3Jan 2, 2026 04:157,45688,972,98159,887,0001,996,0002,478,080
4Jan 2, 2026 04:157,49088,731,13560,161,0002,005,0002,330,624
5Jan 2, 2026 04:157,57489,577,00259,872,0002,993,0002,514,944
6Jan 2, 2026 04:157,66193,080,14860,557,0003,027,0002,449,408