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 21, 2026 11:52Daniel MastalerzDaniel MastalerzScore: 5,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 11:555,91774,080,94745,104,0004,009,0002,326,528
2Feb 21, 2026 11:555,92875,053,82746,188,0003,012,0002,269,184
3Feb 21, 2026 11:555,95070,340,07645,355,0004,031,0002,523,136