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 listJun 24, 2026 23:27Victor MerckléVictor MerckléScore: 4,584Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:284,56045,348,08036,732,0001,121,0002,113,536
2Jun 24, 2026 23:284,56445,752,97336,793,0001,095,0002,113,536
3Jun 24, 2026 23:284,57445,564,22636,874,0001,095,0002,113,536
4Jun 24, 2026 23:284,57645,601,72836,906,0001,078,0002,113,536
5Jun 24, 2026 23:284,58445,566,01136,973,0001,077,0002,113,536
6Jun 24, 2026 23:284,58545,667,23836,914,0001,142,0002,113,536
7Jun 24, 2026 23:284,59245,738,57537,033,0001,081,0002,113,536
8Jun 24, 2026 23:284,59345,715,63137,018,0001,109,0002,113,536
9Jun 24, 2026 23:284,86348,312,76339,258,0001,110,0002,113,536