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 listFeb 23, 2026 21:37Daniel MastalerzDaniel MastalerzScore: 5,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 21:375,76277,451,02044,833,0002,988,0002,285,568
2Feb 23, 2026 21:375,76871,513,82044,880,0002,992,0002,285,568
3Feb 23, 2026 21:375,77372,710,32045,921,0001,996,0002,285,568
4Feb 23, 2026 21:375,86477,580,84146,645,0002,028,0002,281,472
5Feb 23, 2026 21:375,88573,187,15145,855,0002,990,0002,281,472
6Feb 23, 2026 21:375,92075,646,22746,125,0003,008,0002,277,376