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 12, 2026 18:23Kevin HeaveyKevin HeaveyScore: 3,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 18:243,68540,162,89029,407,0001,185,0002,117,632
2Jul 12, 2026 18:243,69940,254,14529,479,0001,225,0002,117,632
3Jul 12, 2026 18:243,71840,536,42229,581,0001,284,0002,117,632
4Jul 12, 2026 18:243,76340,784,39230,006,0001,228,0002,117,632
5Jul 12, 2026 18:243,77040,858,43530,096,0001,199,0002,117,632
6Jul 12, 2026 18:243,77340,895,41230,021,0001,302,0002,117,632
7Jul 12, 2026 18:243,77440,988,91730,293,0001,038,0002,117,632
8Jul 12, 2026 18:243,77640,911,88830,149,0001,194,0002,117,632
9Jul 12, 2026 18:243,78041,336,78330,079,0001,299,0002,117,632