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 15, 2026 21:51Victor MerckléVictor MerckléScore: 6,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 21:516,97865,292,66156,890,0001,033,0002,113,536
2May 15, 2026 21:516,98265,907,90456,932,0001,021,0002,113,536
3May 15, 2026 21:516,98267,007,59557,958,00002,113,536
4May 15, 2026 21:516,98565,747,36056,973,0001,009,0002,113,536
5May 15, 2026 21:516,98565,336,62756,956,0001,027,0002,113,536
6May 15, 2026 21:516,98765,629,05956,993,0001,001,0002,113,536
7May 15, 2026 21:516,99065,367,49956,983,0001,037,0002,113,536
8May 15, 2026 21:516,99766,288,17457,064,0001,015,0002,113,536
9May 15, 2026 21:517,00367,504,33557,102,0001,030,0002,113,536