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 11, 2026 13:42Victor MerckléVictor MerckléScore: 10,336Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 13:4310,33196,328,92784,512,0001,242,0002,113,536
2May 11, 2026 13:4310,33594,523,79784,528,0001,256,0002,113,536
3May 11, 2026 13:4310,33594,517,43184,535,0001,253,0002,113,536
4May 11, 2026 13:4310,33694,823,17784,531,0001,260,0002,113,536
5May 11, 2026 13:4310,33697,388,92184,547,0001,242,0002,113,536
6May 11, 2026 13:4310,33797,479,91684,538,0001,265,0002,113,536
7May 11, 2026 13:4310,33894,727,77384,539,0001,267,0002,113,536
8May 11, 2026 13:4310,36097,435,49484,978,0001,011,0002,113,536
9May 11, 2026 13:4310,36598,224,34984,788,0001,248,0002,113,536