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 15, 2026 11:58Daniel MastalerzDaniel MastalerzScore: 7,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 11:587,21183,702,17556,863,0002,992,0002,277,376
2Feb 15, 2026 11:587,21485,208,51856,885,0002,993,0002,265,088
3Feb 15, 2026 11:587,22182,350,68156,937,0002,996,0002,265,088
4Feb 15, 2026 11:587,34592,183,63759,967,000999,0002,293,760
5Feb 15, 2026 11:587,35690,559,56558,054,0003,002,0002,260,992
6Feb 15, 2026 11:587,44187,914,75558,776,0002,988,0002,293,760