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 12, 2026 02:20Josu San MartinJosu San MartinScore: 3,871Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 02:203,86339,828,60330,992,0001,077,0002,113,536
2May 12, 2026 02:203,86741,657,07531,015,0001,083,0002,113,536
3May 12, 2026 02:203,86741,608,82530,992,0001,105,0002,113,536
4May 12, 2026 02:203,86741,318,35230,988,0001,111,0002,113,536
5May 12, 2026 02:203,87140,409,97231,053,0001,078,0002,113,536
6May 12, 2026 02:203,87241,611,43531,070,0001,068,0002,113,536
7May 12, 2026 02:203,89542,654,87231,168,0001,162,0002,113,536
8May 12, 2026 02:203,91540,554,68731,415,0001,080,0002,113,536
9May 12, 2026 02:203,98542,421,76832,001,0001,079,0002,113,536