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 21, 2026 13:40Daniel MastalerzDaniel MastalerzScore: 5,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 13:405,72371,628,98743,458,0004,042,0002,265,088
2Feb 21, 2026 13:405,74072,654,15744,598,0003,040,0002,326,528
3Feb 21, 2026 13:405,75374,536,22944,769,0002,984,0002,265,088
4Feb 21, 2026 13:405,82674,713,72045,331,0003,022,0002,318,336
5Feb 21, 2026 13:405,84269,833,23744,446,0004,040,0002,519,040
6Feb 21, 2026 13:405,84570,239,21145,484,0003,032,0002,301,952