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:29M-RochatM-RochatScore: 14,109Success
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:3014,060128,444,735113,451,0003,249,0002,113,536
2May 20, 2026 05:3014,095126,707,010113,727,0003,266,0002,113,536
3May 20, 2026 05:3014,095126,519,378113,721,0003,273,0002,113,536
4May 20, 2026 05:3014,098128,159,906113,756,0003,261,0002,113,536
5May 20, 2026 05:3014,109129,864,414113,869,0003,242,0002,113,536
6May 20, 2026 05:3014,110129,351,955113,881,0003,236,0002,113,536
7May 20, 2026 05:3014,112128,892,774113,871,0003,263,0002,113,536
8May 20, 2026 05:3014,179128,368,365114,389,0003,304,0002,113,536
9May 20, 2026 05:3014,219127,649,788114,569,0003,450,0002,113,536