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 08:19Victor MerckléVictor MerckléScore: 5,837Success
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 08:195,66954,860,67146,039,0001,019,0002,113,536
2May 20, 2026 08:195,69655,113,71846,246,0001,035,0002,113,536
3May 20, 2026 08:195,72557,299,23546,497,0001,024,0002,113,536
4May 20, 2026 08:195,79355,880,46147,065,0001,022,0002,113,536
5May 20, 2026 08:195,83756,971,71647,447,0001,007,0002,113,536
6May 20, 2026 08:195,85756,529,89247,592,0001,022,0002,113,536
7May 20, 2026 08:195,86656,448,26247,668,0001,024,0002,113,536
8May 20, 2026 08:195,87657,356,57947,768,0001,004,0002,113,536
9May 20, 2026 08:195,87758,885,36647,747,0001,035,0002,113,536