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 listJul 3, 2026 23:24Josu San MartinJosu San MartinScore: 10,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 23:2510,15693,934,12783,285,0001,014,0002,113,536
2Jul 3, 2026 23:2510,16093,940,25483,317,0001,015,0002,113,536
3Jul 3, 2026 23:2510,17394,504,94583,421,0001,015,0002,113,536
4Jul 3, 2026 23:2510,20794,289,92383,711,0001,014,0002,113,536
5Jul 3, 2026 23:2510,21694,346,55083,780,0001,014,0002,113,536
6Jul 3, 2026 23:2510,23795,112,55583,961,0001,014,0002,113,536
7Jul 3, 2026 23:2510,24195,051,86583,992,0001,015,0002,113,536
8Jul 3, 2026 23:2510,26095,120,16884,149,0001,015,0002,113,536
9Jul 3, 2026 23:2510,26795,061,18384,205,0001,014,0002,113,536