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 18, 2026 00:23olliecrowolliecrowScore: 7,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 00:236,72779,622,43251,847,0003,988,0002,260,992
2Feb 18, 2026 00:236,73783,314,79351,924,0003,994,0002,494,464
3Feb 18, 2026 00:236,79280,327,69055,367,0001,006,0002,437,120
4Feb 18, 2026 00:237,08188,039,32256,784,0001,992,0002,338,816
5Feb 18, 2026 00:237,09584,004,91454,899,0003,992,0002,445,312
6Feb 18, 2026 00:237,19985,260,27656,765,0002,987,0002,334,720