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 20:00olliecrowolliecrowScore: 11,714Success
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 20:0011,541119,836,83194,796,000997,0002,519,040
2Jan 30, 2026 20:0011,560121,301,13993,946,0001,998,0002,260,992
3Jan 30, 2026 20:0011,709121,829,56594,178,0003,005,0002,293,760
4Jan 30, 2026 20:0011,714124,040,19895,220,0002,004,0002,281,472
5Jan 30, 2026 20:0011,729123,788,79994,338,0003,010,0002,293,760
6Jan 30, 2026 20:0011,870122,666,13496,507,0002,010,0002,293,760