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:48Daniel MastalerzDaniel MastalerzScore: 5,585Success
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:485,49876,349,24142,594,0003,042,0002,314,240
2Feb 24, 2026 18:485,52370,285,82741,859,0003,986,0002,289,664
3Feb 24, 2026 18:485,58069,549,39043,290,0003,020,0002,318,336
4Feb 24, 2026 18:485,58571,775,32042,327,0004,031,0002,318,336
5Feb 24, 2026 18:485,59368,656,02442,382,0004,036,0002,306,048
6Feb 24, 2026 18:485,72975,624,25044,514,0003,035,0002,326,528