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 14, 2026 20:50Kevin HeaveyKevin HeaveyScore: 3,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 20:513,74440,699,11830,056,0001,024,0002,117,632
2Jul 14, 2026 20:513,75340,726,62630,115,0001,035,0002,117,632
3Jul 14, 2026 20:513,76640,963,37530,238,0001,022,0002,117,632
4Jul 14, 2026 20:513,77040,953,17730,268,0001,026,0002,117,632
5Jul 14, 2026 20:513,77440,986,29730,301,0001,025,0002,117,632
6Jul 14, 2026 20:513,80941,235,71930,579,0001,037,0002,117,632
7Jul 14, 2026 20:513,81941,335,14830,654,0001,049,0002,117,632
8Jul 14, 2026 20:513,83552,681,03830,811,0001,027,0002,117,632
9Jul 14, 2026 20:513,85941,668,06030,986,0001,044,0002,117,632