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 10, 2026 19:56Daniel MastalerzDaniel MastalerzScore: 8,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 19:568,35897,902,00866,352,0003,016,0002,306,048
2Feb 10, 2026 19:568,36191,148,75466,382,0003,017,0002,310,144
3Feb 10, 2026 19:568,37694,083,40967,504,0002,015,0002,326,528
4Feb 10, 2026 19:568,526100,618,92467,778,0002,990,0002,269,184
5Feb 10, 2026 19:568,53896,525,60267,874,0002,994,0002,269,184
6Feb 10, 2026 19:568,54096,232,55366,891,0003,993,0002,269,184