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,666Success
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:5712,620113,491,458102,532,0002,218,0002,113,536
2May 17, 2026 01:5712,620113,486,217102,554,0002,193,0002,113,536
3May 17, 2026 01:5712,649115,122,106101,841,0003,152,0002,113,536
4May 17, 2026 01:5712,650115,717,526102,849,0002,146,0002,113,536
5May 17, 2026 01:5712,666114,081,175102,974,0002,161,0002,113,536
6May 17, 2026 01:5712,671115,492,865102,965,0002,205,0002,113,536
7May 17, 2026 01:5712,698115,909,423103,141,0002,254,0002,113,536
8May 17, 2026 01:5712,704114,840,288103,287,0002,162,0002,113,536
9May 17, 2026 01:5712,750116,677,051102,630,0003,202,0002,113,536