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 17, 2026 15:15Kevin HeaveyKevin HeaveyScore: 3,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 15:253,67540,432,32629,458,0001,049,0002,113,536
2Jul 17, 2026 15:253,68040,371,43929,497,0001,048,0002,113,536
3Jul 17, 2026 15:253,68740,451,24629,562,0001,047,0002,113,536
4Jul 17, 2026 15:253,69640,575,08029,631,0001,047,0002,113,536
5Jul 17, 2026 15:253,70650,136,81629,719,0001,049,0002,113,536
6Jul 17, 2026 15:253,83344,616,74330,768,0001,046,0002,113,536
7Jul 17, 2026 15:253,90751,844,74931,391,0001,044,0002,113,536
8Jul 17, 2026 15:253,95253,145,10231,778,0001,029,0002,117,632
9Jul 17, 2026 15:253,99142,940,49932,087,0001,044,0002,113,536