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:40M-RochatM-RochatScore: 12,477Success
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:4012,451113,642,346100,991,0002,353,0002,113,536
2May 20, 2026 05:4012,468112,946,785101,143,0002,344,0002,113,536
3May 20, 2026 05:4012,472113,797,052101,184,0002,341,0002,113,536
4May 20, 2026 05:4012,473112,928,973101,197,0002,332,0002,113,536
5May 20, 2026 05:4012,477112,927,683101,547,0002,014,0002,113,536
6May 20, 2026 05:4012,486116,179,442101,294,0002,344,0002,113,536
7May 20, 2026 05:4012,489113,732,215101,314,0002,347,0002,113,536
8May 20, 2026 05:4012,542113,794,151102,000,0002,102,0002,113,536
9May 20, 2026 05:4012,565114,873,145102,223,0002,070,0002,113,536