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:33Josu San MartinJosu San MartinScore: 7,558Success
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:357,37970,534,82258,159,0003,089,0002,113,536
2Jul 3, 2026 23:357,43270,973,31558,577,0003,113,0002,113,536
3Jul 3, 2026 23:357,50881,478,52260,261,0002,061,0002,113,536
4Jul 3, 2026 23:357,54671,968,65359,412,0003,222,0002,113,536
5Jul 3, 2026 23:357,55872,122,86859,541,0003,197,0002,113,536
6Jul 3, 2026 23:357,56272,153,25859,548,0003,223,0002,113,536
7Jul 3, 2026 23:357,58972,446,59359,892,0003,097,0002,113,536
8Jul 3, 2026 23:357,60872,484,17260,025,0003,122,0002,113,536
9Jul 3, 2026 23:357,83074,367,80861,894,0003,100,0002,113,536