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 19, 2026 22:10Daniel MastalerzDaniel MastalerzScore: 5,823Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 22:105,74480,810,92244,635,0003,043,0002,306,048
2Feb 19, 2026 22:105,75674,964,02543,797,0003,981,0002,310,144
3Feb 19, 2026 22:105,82070,778,84145,289,0003,019,0002,273,280
4Feb 19, 2026 22:105,82376,923,21844,303,0004,027,0002,306,048
5Feb 19, 2026 22:105,84371,665,43344,458,0004,041,0002,322,432
6Feb 19, 2026 22:105,86176,928,69146,618,0002,026,0002,330,624