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 14:58Victor 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 14:596,96667,493,53556,801,0001,022,0002,113,536
2May 15, 2026 14:596,96766,672,26156,790,0001,040,0002,113,536
3May 15, 2026 14:596,96965,503,01756,843,0001,001,0002,113,536
4May 15, 2026 14:596,96965,141,85756,808,0001,037,0002,113,536
5May 15, 2026 14:596,97365,902,53556,834,0001,043,0002,113,536
6May 15, 2026 14:597,01967,101,48458,260,00002,113,536
7May 15, 2026 14:597,02666,808,84957,296,0001,028,0002,113,536
8May 15, 2026 14:597,02866,769,91157,333,0001,005,0002,113,536
9May 15, 2026 14:597,03165,902,72657,334,0001,030,0002,113,536