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 listAug 4, 2026 15:35boop34boop34Score: 15,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 15:3515,412137,891,379126,885,0001,042,0002,113,536
2Aug 4, 2026 15:3515,423137,995,265126,958,0001,057,0002,113,536
3Aug 4, 2026 15:3515,424138,178,286126,940,0001,087,0002,113,536
4Aug 4, 2026 15:3515,425138,112,113126,973,0001,057,0002,113,536
5Aug 4, 2026 15:3515,439138,130,250127,089,0001,059,0002,113,536
6Aug 4, 2026 15:3515,462139,124,352127,328,0001,009,0002,113,536
7Aug 4, 2026 15:3515,463139,091,663127,253,0001,091,0002,113,536
8Aug 4, 2026 15:3515,691140,281,715129,176,0001,062,0002,113,536
9Aug 4, 2026 15:3515,705141,133,759129,288,0001,068,0002,113,536