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 22:36Kevin HeaveyKevin HeaveyScore: 3,709Success
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 22:373,68840,238,30029,592,0001,023,0002,117,632
2Jul 14, 2026 22:373,69440,261,07129,617,0001,044,0002,117,632
3Jul 14, 2026 22:373,69940,359,52529,668,0001,039,0002,117,632
4Jul 14, 2026 22:373,70840,346,54229,758,0001,023,0002,117,632
5Jul 14, 2026 22:373,70940,374,12029,767,0001,021,0002,117,632
6Jul 14, 2026 22:373,71140,421,50929,778,0001,025,0002,117,632
7Jul 14, 2026 22:373,75740,760,45930,146,0001,041,0002,117,632
8Jul 14, 2026 22:373,77840,960,79330,319,0001,039,0002,117,632
9Jul 14, 2026 22:373,78342,526,16130,353,0001,046,0002,117,632