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 19:00Kasper KivimäkiKasper KivimäkiScore: 58,159Success
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 19:0057,392486,373,160475,277,0001,081,0002,113,536
2Jul 22, 2026 19:0057,835490,796,757479,004,0001,034,0002,113,536
3Jul 22, 2026 19:0057,854490,254,629479,191,0001,004,0002,113,536
4Jul 22, 2026 19:0057,959491,791,146480,059,0001,006,0002,113,536
5Jul 22, 2026 19:0058,159493,359,158481,721,0001,003,0002,113,536
6Jul 22, 2026 19:0058,669497,508,028485,877,0001,079,0002,113,536
7Jul 22, 2026 19:0058,699497,579,827486,097,0001,110,0002,113,536
8Jul 22, 2026 19:0058,702497,988,859486,223,0001,006,0002,113,536
9Jul 22, 2026 19:0058,784498,146,465486,913,0001,002,0002,113,536