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 11, 2026 01:45Josu San MartinJosu San MartinScore: 3,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 01:453,85739,684,25530,942,0001,077,0002,113,536
2May 11, 2026 01:453,86141,978,44130,980,0001,070,0002,113,536
3May 11, 2026 01:453,86841,556,97331,021,0001,087,0002,113,536
4May 11, 2026 01:453,87141,748,19031,049,0001,084,0002,113,536
5May 11, 2026 01:453,88240,589,79131,154,0001,067,0002,113,536
6May 11, 2026 01:453,91240,157,88731,413,0001,063,0002,113,536
7May 11, 2026 01:453,92142,179,32531,470,0001,079,0002,113,536
8May 11, 2026 01:453,93740,972,94231,592,0001,086,0002,113,536
9May 11, 2026 01:453,95842,665,39331,770,0001,089,0002,113,536