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 30, 2026 19:41boop34boop34Score: 8,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 19:418,36679,321,71968,417,0001,021,0002,113,536
2Jul 30, 2026 19:418,37379,357,88868,477,0001,019,0002,113,536
3Jul 30, 2026 19:418,38279,374,58368,551,0001,020,0002,113,536
4Jul 30, 2026 19:418,38379,490,01468,564,0001,019,0002,113,536
5Jul 30, 2026 19:418,41579,690,66468,829,0001,020,0002,113,536
6Jul 30, 2026 19:418,42279,857,98368,889,0001,021,0002,113,536
7Jul 30, 2026 19:418,42381,009,00068,899,0001,019,0002,113,536
8Jul 30, 2026 19:418,44679,960,12669,083,0001,019,0002,113,536
9Jul 30, 2026 19:418,47980,243,20869,361,0001,020,0002,113,536