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 20, 2026 10:01M-RochatM-RochatScore: 11,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:0111,905110,068,87996,785,0002,032,0002,113,536
2May 20, 2026 10:0111,917110,257,05396,885,0002,033,0002,113,536
3May 20, 2026 10:0111,921110,434,89096,919,0002,033,0002,113,536
4May 20, 2026 10:0111,964109,383,97697,033,0002,270,0002,113,536
5May 20, 2026 10:0111,966111,524,00097,046,0002,274,0002,113,536
6May 20, 2026 10:0111,973109,936,59197,080,0002,300,0002,113,536
7May 20, 2026 10:0111,977109,606,98797,142,0002,272,0002,113,536
8May 20, 2026 10:0111,991109,088,07197,255,0002,273,0002,113,536
9May 20, 2026 10:0112,023109,293,12197,536,0002,260,0002,113,536