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 listFeb 11, 2026 19:27olliecrowolliecrowScore: 6,490Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 19:276,19373,309,38547,374,0004,031,0002,330,624
2Feb 11, 2026 19:276,19872,492,40748,415,0003,025,0002,461,696
3Feb 11, 2026 19:276,22177,856,74848,595,0003,037,0002,371,584
4Feb 11, 2026 19:276,49079,063,86849,879,0003,990,0002,301,952
5Feb 11, 2026 19:276,49877,202,00450,937,0002,996,0002,510,848
6Feb 11, 2026 19:276,52776,818,64351,169,0003,009,0002,494,464