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 10, 2026 18:39Josu San MartinJosu San MartinScore: 3,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 18:393,85640,428,27430,921,0001,086,0002,113,536
2May 10, 2026 18:393,86841,443,01331,028,0001,081,0002,113,536
3May 10, 2026 18:393,87541,383,37231,069,0001,100,0002,113,536
4May 10, 2026 18:393,88840,168,61131,191,0001,087,0002,113,536
5May 10, 2026 18:393,92340,224,99931,466,0001,095,0002,113,536
6May 10, 2026 18:393,93240,309,10631,558,0001,081,0002,113,536
7May 10, 2026 18:393,93440,973,98431,582,0001,076,0002,113,536
8May 10, 2026 18:394,00041,477,27532,097,0001,107,0002,113,536
9May 10, 2026 18:394,01242,882,03432,220,0001,087,0002,113,536