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 listJul 22, 2026 18:40Kasper KivimäkiKasper KivimäkiScore: 57,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 18:4157,347485,842,822474,815,0001,167,0002,113,536
2Jul 22, 2026 18:4157,451486,731,279475,675,0001,169,0002,113,536
3Jul 22, 2026 18:4157,474487,577,033475,786,0001,256,0002,113,536
4Jul 22, 2026 18:4157,964491,018,638480,106,0001,001,0002,113,536
5Jul 22, 2026 18:4157,979491,079,666480,216,0001,012,0002,113,536
6Jul 22, 2026 18:4158,087492,089,382481,123,0001,002,0002,113,536
7Jul 22, 2026 18:4158,643496,561,213485,585,0001,160,0002,113,536
8Jul 22, 2026 18:4158,669496,831,744485,784,0001,171,0002,113,536
9Jul 22, 2026 18:4158,717497,377,397486,338,0001,015,0002,113,536