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:51M-RochatM-RochatScore: 12,489Success
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:5112,443113,192,574100,948,0002,336,0002,113,536
2May 20, 2026 05:5112,458113,211,646101,046,0002,359,0002,113,536
3May 20, 2026 05:5112,462114,105,834101,093,0002,347,0002,113,536
4May 20, 2026 05:5112,470114,759,889101,167,0002,337,0002,113,536
5May 20, 2026 05:5112,489114,954,120101,324,0002,338,0002,113,536
6May 20, 2026 05:5112,534113,445,287101,691,0002,349,0002,113,536
7May 20, 2026 05:5112,544115,302,725102,073,0002,043,0002,113,536
8May 20, 2026 05:5112,575113,932,326102,312,0002,065,0002,113,536
9May 20, 2026 05:5112,585115,031,011102,290,0002,170,0002,113,536