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 05:42M-RochatM-RochatScore: 12,530Success
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 05:4212,454114,534,359101,030,0002,345,0002,113,536
2May 20, 2026 05:4212,486114,852,964101,629,0002,011,0002,113,536
3May 20, 2026 05:4212,515114,281,891101,867,0002,008,0002,113,536
4May 20, 2026 05:4212,527114,155,928101,930,0002,048,0002,113,536
5May 20, 2026 05:4212,530113,836,899101,967,0002,034,0002,113,536
6May 20, 2026 05:4212,560115,640,422102,196,0002,052,0002,113,536
7May 20, 2026 05:4212,569114,094,195102,243,0002,082,0002,113,536
8May 20, 2026 05:4212,602114,510,092102,542,0002,058,0002,113,536
9May 20, 2026 05:4212,610114,695,397102,650,0002,016,0002,113,536