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:36Daniel MastalerzDaniel MastalerzScore: 5,836Success
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:365,73879,843,97245,597,0002,026,0002,285,568
2Feb 21, 2026 13:365,75178,816,82943,756,0003,977,0002,306,048
3Feb 21, 2026 13:365,76077,486,65644,820,0002,988,0002,269,184
4Feb 21, 2026 13:365,83671,154,72247,433,0001,009,0002,301,952
5Feb 21, 2026 13:365,83771,836,44445,422,0003,028,0002,285,568
6Feb 21, 2026 13:365,84480,239,37245,478,0003,031,0002,297,856