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 2, 2026 18:42A_ShamanA_ShamanScore: 39,150Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 18:4239,103334,131,383323,551,0001,005,0002,113,536
2Jul 2, 2026 18:4239,111334,675,013322,564,0002,065,0002,113,536
3Jul 2, 2026 18:4239,134335,000,319322,810,0002,004,0002,113,536
4Jul 2, 2026 18:4239,138336,323,417323,843,0001,004,0002,113,536
5Jul 2, 2026 18:4239,150334,497,825323,943,0001,005,0002,113,536
6Jul 2, 2026 18:4239,155335,006,072322,981,0002,011,0002,113,536
7Jul 2, 2026 18:4239,158334,583,718324,008,0001,004,0002,113,536
8Jul 2, 2026 18:4239,166334,619,084322,956,0002,124,0002,113,536
9Jul 2, 2026 18:4239,167335,068,393323,079,0002,012,0002,113,536