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 00:47Josu San MartinJosu San MartinScore: 3,901Success
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 00:473,87540,422,91731,098,0001,072,0002,113,536
2May 11, 2026 00:473,88240,691,26131,161,0001,062,0002,113,536
3May 11, 2026 00:473,88439,867,50431,169,0001,070,0002,113,536
4May 11, 2026 00:473,88539,685,50131,170,0001,078,0002,113,536
5May 11, 2026 00:473,90143,279,43231,307,0001,076,0002,113,536
6May 11, 2026 00:473,91241,677,71831,388,0001,087,0002,113,536
7May 11, 2026 00:473,93340,298,94531,595,0001,057,0002,113,536
8May 11, 2026 00:473,93740,378,96231,598,0001,082,0002,113,536
9May 11, 2026 00:473,94542,416,65431,674,0001,076,0002,113,536