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 listJan 30, 2026 19:44olliecrowolliecrowScore: 11,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 19:4411,117117,650,49988,257,0004,011,0002,461,696
2Jan 30, 2026 19:4411,146120,156,35991,506,0001,005,0002,281,472
3Jan 30, 2026 19:4411,158120,599,49990,600,0002,013,0002,281,472
4Jan 30, 2026 19:4411,583123,611,93093,135,0003,004,0002,285,568
5Jan 30, 2026 19:4411,636128,864,79595,570,0001,006,0002,445,312
6Jan 30, 2026 19:4411,804122,588,99795,976,0001,999,0002,445,312