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 listJul 5, 2026 20:20Kevin HeaveyKevin HeaveyScore: 10,128Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:219,96692,362,52180,777,0001,942,0002,121,728stderr
2Jul 5, 2026 20:2110,01792,677,19981,189,0001,955,0002,121,728stderr
3Jul 5, 2026 20:2110,04292,938,22981,399,0001,951,0002,121,728stderr
4Jul 5, 2026 20:2110,10593,478,68181,938,0001,937,0002,121,728stderr
5Jul 5, 2026 20:2110,12893,702,93082,128,0001,939,0002,121,728stderr
6Jul 5, 2026 20:2110,13393,677,27682,165,0001,943,0002,121,728stderr
7Jul 5, 2026 20:2110,13493,710,70882,182,0001,937,0002,121,728stderr
8Jul 5, 2026 20:2110,16393,946,86482,408,0001,945,0002,121,728stderr
9Jul 5, 2026 20:2110,397121,182,57683,200,0003,097,0002,125,824stderr