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:11Josu San MartinJosu San MartinScore: 3,916Success
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:113,87442,155,81431,086,0001,071,0002,113,536
2May 11, 2026 01:113,87739,819,87131,126,0001,056,0002,113,536
3May 11, 2026 01:113,88041,695,76931,136,0001,070,0002,113,536
4May 11, 2026 01:113,88840,139,46531,158,0001,118,0002,113,536
5May 11, 2026 01:113,91641,887,01931,424,0001,080,0002,113,536
6May 11, 2026 01:113,91742,343,57431,415,0001,103,0002,113,536
7May 11, 2026 01:113,92140,277,19531,457,0001,089,0002,113,536
8May 11, 2026 01:113,94042,410,41131,593,0001,116,0002,113,536
9May 11, 2026 01:113,97154,492,02331,859,0001,106,0002,113,536