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:41Kasper KivimäkiKasper KivimäkiScore: 58,657Success
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:4357,470487,648,868475,917,0001,084,0002,113,536
2Jul 22, 2026 18:4358,111492,910,022481,317,0001,007,0002,113,536
3Jul 22, 2026 18:4358,270493,591,493482,616,0001,027,0002,113,536
4Jul 22, 2026 18:4358,348494,783,722483,289,0001,001,0002,113,536
5Jul 22, 2026 18:4358,657497,427,050485,857,0001,001,0002,113,536
6Jul 22, 2026 18:4358,667497,560,842485,682,0001,260,0002,113,536
7Jul 22, 2026 18:4358,675497,665,575486,004,0001,002,0002,113,536
8Jul 22, 2026 18:4358,700497,731,421485,953,0001,260,0002,113,536
9Jul 22, 2026 18:4358,731497,359,633486,458,0001,010,0002,113,536