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 10, 2026 10:54Josu San MartinJosu San MartinScore: 4,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:554,07651,662,18432,796,0001,038,0002,490,368
2May 10, 2026 10:554,08151,667,08632,743,0001,130,0002,490,368
3May 10, 2026 10:554,08851,162,48232,804,0001,127,0002,490,368
4May 10, 2026 10:554,08945,875,19932,908,0001,038,0002,486,272
5May 10, 2026 10:554,09147,125,54232,861,0001,098,0002,482,176
6May 10, 2026 10:554,09247,747,89332,836,0001,134,0002,486,272
7May 10, 2026 10:554,09948,909,57532,956,0001,070,0002,486,272
8May 10, 2026 10:554,10451,469,75032,909,0001,158,0002,482,176
9May 10, 2026 10:554,15648,584,53333,397,0001,105,0002,478,080