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:52M-RochatM-RochatScore: 14,101Success
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:5214,034127,413,114114,298,0002,188,0002,113,536
2May 17, 2026 01:5214,068126,417,472114,535,0002,232,0002,113,536
3May 17, 2026 01:5214,070125,566,446114,573,0002,215,0002,113,536
4May 17, 2026 01:5214,073127,323,505114,613,0002,194,0002,113,536
5May 17, 2026 01:5214,101125,804,965114,849,0002,197,0002,113,536
6May 17, 2026 01:5214,103126,139,625114,810,0002,249,0002,113,536
7May 17, 2026 01:5214,105127,879,958114,895,0002,183,0002,113,536
8May 17, 2026 01:5214,125126,821,661114,944,0002,297,0002,113,536
9May 17, 2026 01:5214,165127,481,366115,355,0002,219,0002,113,536