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 24, 2026 18:36Daniel MastalerzDaniel MastalerzScore: 5,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 18:365,52169,136,60341,842,0003,984,0002,310,144
2Feb 24, 2026 18:365,52370,301,31041,859,0003,986,0002,514,944
3Feb 24, 2026 18:365,55367,684,60042,080,0004,007,0002,326,528
4Feb 24, 2026 18:365,62373,818,75543,626,0003,043,0002,318,336
5Feb 24, 2026 18:365,66571,866,08644,018,0003,001,0002,301,952
6Feb 24, 2026 18:365,68673,240,14943,176,0004,016,0002,260,992