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 12:25Daniel MastalerzDaniel MastalerzScore: 9,428Success
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 12:259,203103,755,68774,371,0002,010,0002,265,088
2Feb 15, 2026 12:259,212103,190,37674,444,0002,012,0002,301,952
3Feb 15, 2026 12:259,231105,183,07574,598,0002,016,0002,281,472
4Feb 15, 2026 12:259,428104,838,35575,240,0003,009,0002,293,760
5Feb 15, 2026 12:259,744132,855,38278,853,0002,021,0002,289,664
6Feb 15, 2026 12:259,883109,398,82079,025,0003,000,0002,293,760