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 18, 2026 00:20Daniel MastalerzDaniel MastalerzScore: 8,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 00:208,17096,900,06563,825,0003,989,0002,310,144
2Feb 18, 2026 00:208,18996,025,01863,973,0003,998,0002,330,624
3Feb 18, 2026 00:208,25097,735,16966,463,0002,014,0002,310,144
4Feb 18, 2026 00:208,33098,628,07865,134,0004,008,0002,322,432
5Feb 18, 2026 00:208,33992,244,69266,204,0003,009,0002,322,432
6Feb 18, 2026 00:208,34593,659,76865,246,0004,015,0002,306,048