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 10, 2026 13:16wnwnScore: 3,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:163,29637,788,56827,361,00002,113,536
2May 10, 2026 13:163,41055,250,66428,306,00002,113,536
3May 10, 2026 13:163,41237,914,78428,325,00002,113,536
4May 10, 2026 13:163,41637,856,76228,361,00002,113,536
5May 10, 2026 13:163,43837,914,37628,536,00002,113,536
6May 10, 2026 13:163,44037,331,18428,560,00002,113,536
7May 10, 2026 13:163,44138,419,05128,562,00002,113,536
8May 10, 2026 13:163,47438,263,10628,842,00002,113,536
9May 10, 2026 13:163,62758,812,61830,112,00002,113,536