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 05:04Victor MerckléVictor MerckléScore: 6,969Success
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 05:046,96267,446,72156,750,0001,038,0002,113,536
2May 15, 2026 05:046,96766,256,35057,827,00002,113,536
3May 15, 2026 05:046,96765,148,71557,831,00002,113,536
4May 15, 2026 05:046,96765,399,56657,831,00002,113,536
5May 15, 2026 05:046,96965,225,99056,834,0001,016,0002,113,536
6May 15, 2026 05:046,98366,928,64656,883,0001,082,0002,113,536
7May 15, 2026 05:046,98966,453,25356,973,0001,036,0002,113,536
8May 15, 2026 05:047,01266,862,53658,206,00002,113,536
9May 15, 2026 05:047,02367,663,61658,293,00002,113,536