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 listMay 20, 2026 10:24Victor MerckléVictor MerckléScore: 5,888Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:255,80055,970,63247,126,0001,020,0002,113,536
2May 20, 2026 10:255,84256,295,00247,489,0001,001,0002,113,536
3May 20, 2026 10:255,88256,643,76347,823,0001,004,0002,113,536
4May 20, 2026 10:255,88356,652,62947,831,0001,001,0002,113,536
5May 20, 2026 10:255,88858,084,45347,866,0001,007,0002,113,536
6May 20, 2026 10:255,89157,150,85647,896,0001,007,0002,113,536
7May 20, 2026 10:255,89256,741,96947,901,0001,003,0002,113,536
8May 20, 2026 10:255,91056,877,63248,009,0001,052,0002,113,536
9May 20, 2026 10:255,93559,779,53848,226,0001,035,0002,113,536