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 listJun 27, 2026 13:22Daniel MastalerzDaniel MastalerzError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 13:24045,698,11435,236,0001,035,0002,113,536expected "53688284364279861 ", got "53688284338679861"
2Jun 27, 2026 13:244,33145,413,24234,915,0001,039,0002,113,536
3Jun 27, 2026 13:244,33745,511,56834,972,0001,029,0002,113,536
4Jun 27, 2026 13:244,34145,546,10134,992,0001,045,0002,113,536
5Jun 27, 2026 13:244,34345,538,40735,012,0001,036,0002,113,536
6Jun 27, 2026 13:244,34546,746,61035,034,0001,032,0002,113,536
7Jun 27, 2026 13:244,34645,586,95635,036,0001,042,0002,113,536
8Jun 27, 2026 13:244,34645,519,45935,034,0001,044,0002,113,536
9Jun 27, 2026 13:244,39346,036,10635,429,0001,034,0002,113,536