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 12, 2026 03:18olliecrowolliecrowScore: 9,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2026 03:189,526103,389,55476,065,0003,002,0002,367,488
2Feb 12, 2026 03:189,577107,695,41778,480,0001,006,0002,519,040
3Feb 12, 2026 03:189,610106,822,89477,768,0001,994,0002,260,992
4Feb 12, 2026 03:189,621102,301,77777,857,0001,996,0002,412,544
5Feb 12, 2026 03:189,703106,398,86478,525,0002,013,0002,256,896
6Feb 12, 2026 03:1810,069110,347,75881,557,0002,013,0002,486,272