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 listMay 15, 2026 13:07Victor MerckléVictor MerckléScore: 6,971Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 13:086,96268,052,68957,792,00002,113,536
2May 15, 2026 13:086,96365,621,49356,793,0001,006,0002,113,536
3May 15, 2026 13:086,96565,785,12656,771,0001,045,0002,113,536
4May 15, 2026 13:086,96765,216,43657,834,00002,113,536
5May 15, 2026 13:086,97165,543,96956,855,0001,006,0002,113,536
6May 15, 2026 13:086,97667,191,97756,886,0001,017,0002,113,536
7May 15, 2026 13:087,00177,336,59257,064,0001,050,0002,113,536
8May 15, 2026 13:087,01666,976,51657,226,0001,008,0002,113,536
9May 15, 2026 13:087,04978,244,85157,452,0001,056,0002,113,536