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 17, 2026 01:57M-RochatM-RochatScore: 12,669Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:5812,626114,886,192102,633,0002,170,0002,113,536
2May 17, 2026 01:5812,656115,817,051102,821,0002,228,0002,113,536
3May 17, 2026 01:5812,662114,747,109102,952,0002,149,0002,113,536
4May 17, 2026 01:5812,664113,853,336102,924,0002,195,0002,113,536
5May 17, 2026 01:5812,669115,166,757102,955,0002,204,0002,113,536
6May 17, 2026 01:5812,682114,102,094103,055,0002,206,0002,113,536
7May 17, 2026 01:5812,686114,715,007103,101,0002,200,0002,113,536
8May 17, 2026 01:5812,733114,451,482103,520,0002,172,0002,113,536
9May 17, 2026 01:5812,756114,632,850102,561,0003,314,0002,113,536