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 15, 2026 18:41Daniel MastalerzDaniel MastalerzScore: 10,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 18:4110,456112,117,52183,761,0003,027,0002,273,280
2Feb 15, 2026 18:4110,574112,933,26884,775,0002,992,0002,371,584
3Feb 15, 2026 18:4110,593114,416,97983,926,0003,996,0002,326,528
4Feb 15, 2026 18:4110,774112,929,92886,411,0003,014,0002,318,336
5Feb 15, 2026 18:4110,984115,808,89087,164,0004,007,0002,306,048
6Feb 15, 2026 18:4111,068119,232,34088,866,0002,995,0002,306,048