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 11:36Daniel MastalerzDaniel MastalerzScore: 8,062Success
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 11:367,89897,514,22763,534,0002,016,0002,269,184
2Feb 15, 2026 11:367,92596,048,97164,782,000996,0002,306,048
3Feb 15, 2026 11:367,94589,826,35562,945,0002,997,0002,306,048
4Feb 15, 2026 11:368,06294,548,54963,922,0002,996,0002,297,856
5Feb 15, 2026 11:368,11793,757,53765,364,0002,011,0002,265,088
6Feb 15, 2026 11:368,11988,602,55864,372,0003,017,0002,297,856