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 11:27Victor MerckléVictor MerckléScore: 6,973Success
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 11:276,96466,834,10457,806,00002,113,536
2May 15, 2026 11:276,96566,556,21957,817,00002,113,536
3May 15, 2026 11:276,96567,975,69056,779,0001,034,0002,113,536
4May 15, 2026 11:276,96965,145,97457,847,00002,113,536
5May 15, 2026 11:276,97367,029,62056,858,0001,019,0002,113,536
6May 15, 2026 11:276,98868,059,78456,851,0001,157,0002,113,536
7May 15, 2026 11:276,99167,550,76057,021,0001,007,0002,113,536
8May 15, 2026 11:277,02265,764,79957,249,0001,039,0002,113,536
9May 15, 2026 11:277,09466,214,23257,864,0001,021,0002,113,536