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:30M-RochatM-RochatScore: 12,122Success
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:3012,017121,623,68196,684,0003,061,0002,113,536
2May 20, 2026 06:3012,085123,145,34397,222,0003,087,0002,113,536
3May 20, 2026 06:3012,117122,613,45897,470,0003,107,0002,113,536
4May 20, 2026 06:3012,122126,822,85897,497,0003,122,0002,113,536
5May 20, 2026 06:3012,122126,765,49797,396,0003,221,0002,113,536
6May 20, 2026 06:3012,139121,588,48397,656,0003,102,0002,113,536
7May 20, 2026 06:3012,168119,652,47097,719,0003,282,0002,113,536
8May 20, 2026 06:3012,194125,788,28898,079,0003,136,0002,113,536
9May 20, 2026 06:3012,200116,955,28497,990,0003,272,0002,113,536