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 16:06Kevin HeaveyKevin HeaveyScore: 3,813Success
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 16:103,63740,249,72229,143,0001,052,0002,117,632
2Jul 17, 2026 16:103,67940,367,29029,485,0001,051,0002,117,632
3Jul 17, 2026 16:103,75340,953,19130,110,0001,048,0002,117,632
4Jul 17, 2026 16:103,80941,329,01830,577,0001,045,0002,117,632
5Jul 17, 2026 16:103,81341,472,71230,611,0001,045,0002,117,632
6Jul 17, 2026 16:103,81741,481,43930,646,0001,040,0002,117,632
7Jul 17, 2026 16:103,88542,061,56931,038,0001,215,0002,117,632
8Jul 17, 2026 16:103,89142,116,76831,260,0001,042,0002,117,632
9Jul 17, 2026 16:103,90642,241,21531,379,0001,044,0002,117,632