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:28Kevin HeaveyKevin HeaveyScore: 16,172Success
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:293,67040,113,32929,444,0001,019,0002,117,632
2Jul 14, 2026 20:293,68840,225,15729,590,0001,023,0002,117,632
3Jul 14, 2026 20:2916,122143,489,101132,812,0001,006,0002,117,632
4Jul 14, 2026 20:2916,159143,779,687133,120,0001,005,0002,117,632
5Jul 14, 2026 20:2916,172143,813,451133,226,0001,006,0002,117,632
6Jul 14, 2026 20:2916,187143,956,841133,349,0001,005,0002,117,632
7Jul 14, 2026 20:2916,190144,049,654133,375,0001,005,0002,117,632
8Jul 14, 2026 20:2916,209144,202,492133,532,0001,006,0002,117,632
9Jul 14, 2026 20:2916,262144,672,162133,968,0001,009,0002,117,632