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 listFeb 7, 2026 17:01Benn TanBenn TanScore: 67,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 17:0167,894593,279,087561,523,0001,998,0002,461,696
2Feb 7, 2026 17:0167,895588,932,321561,532,0001,998,0002,424,832
3Feb 7, 2026 17:0167,895592,220,683561,532,0001,998,0002,428,928
4Feb 7, 2026 17:0167,897593,513,775563,546,00002,424,832
5Feb 7, 2026 17:0167,902590,661,491560,587,0002,997,0002,441,216
6Feb 7, 2026 17:0167,906590,176,368561,620,0001,998,0002,441,216
7Feb 7, 2026 17:0167,912593,409,578560,672,0002,998,0002,437,120
8Feb 7, 2026 17:0167,919590,049,550559,733,0003,998,0002,461,696
9Feb 7, 2026 17:0167,968586,386,161560,135,0004,000,0002,424,832