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 listSep 25, 2026 18:12Karthik ReddyKarthik ReddyScore: 5,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 18:135,09052,575,88041,105,0001,149,0002,113,536
2Sep 25, 2026 18:135,22653,655,29042,228,0001,149,0002,113,536
3Sep 25, 2026 18:135,24253,766,78142,383,0001,130,0002,113,536
4Sep 25, 2026 18:135,24254,434,90442,383,0001,130,0002,113,536
5Sep 25, 2026 18:135,24653,806,00842,410,0001,134,0002,113,536
6Sep 25, 2026 18:135,25053,845,41242,435,0001,146,0002,113,536
7Sep 25, 2026 18:135,25453,864,16442,480,0001,133,0002,113,536
8Sep 25, 2026 18:135,26053,921,38242,525,0001,138,0002,113,536
9Sep 25, 2026 18:135,31454,444,86142,949,0001,164,0002,113,536