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 10:25M-RochatM-RochatScore: 6,768Success
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 10:256,72765,253,76153,747,0002,091,0002,113,536
2May 20, 2026 10:256,74165,303,00853,893,0002,061,0002,113,536
3May 20, 2026 10:256,74365,844,37553,912,0002,055,0002,113,536
4May 20, 2026 10:256,76267,432,26354,052,0002,079,0002,113,536
5May 20, 2026 10:256,76867,760,70854,103,0002,074,0002,113,536
6May 20, 2026 10:256,83868,610,95054,614,0002,145,0002,113,536
7May 20, 2026 10:256,85071,304,16654,679,0002,176,0002,113,536
8May 20, 2026 10:256,85168,635,10254,694,0002,177,0002,113,536
9May 20, 2026 10:256,87368,065,49954,874,0002,177,0002,113,536