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 06:44M-RochatM-RochatScore: 11,900Success
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 06:4411,876110,534,79396,522,0002,057,0002,113,536
2May 20, 2026 06:4411,885108,460,02796,601,0002,052,0002,113,536
3May 20, 2026 06:4411,888108,122,45096,635,0002,036,0002,113,536
4May 20, 2026 06:4411,896110,523,08796,678,0002,066,0002,113,536
5May 20, 2026 06:4411,900109,979,83196,734,0002,040,0002,113,536
6May 20, 2026 06:4411,904108,849,69296,725,0002,079,0002,113,536
7May 20, 2026 06:4411,907110,718,20896,776,0002,060,0002,113,536
8May 20, 2026 06:4411,915108,889,59196,833,0002,065,0002,113,536
9May 20, 2026 06:4411,920109,975,20996,873,0002,070,0002,113,536