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 8, 2026 10:57Daniel MastalerzDaniel MastalerzScore: 13,398Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 10:5713,363133,672,326105,916,0004,996,0002,306,048
2Feb 8, 2026 10:5713,382137,516,431106,071,0005,003,0002,392,064
3Feb 8, 2026 10:5713,384130,522,886106,085,0005,004,0002,400,256
4Feb 8, 2026 10:5713,397133,468,455109,190,0002,003,0002,396,160
5Feb 8, 2026 10:5713,398139,624,333108,199,0003,005,0002,322,432
6Feb 8, 2026 10:5713,409146,026,491107,286,0004,010,0002,392,064
7Feb 8, 2026 10:5713,414138,604,998107,323,0004,012,0002,396,160
8Feb 8, 2026 10:5713,461136,260,585106,740,0004,987,0002,400,256
9Feb 8, 2026 10:5713,492137,853,476104,984,0006,998,0002,392,064