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 19, 2026 21:29Daniel MastalerzDaniel MastalerzScore: 5,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 21:295,72774,450,23044,502,0003,034,0002,330,624
2Feb 19, 2026 21:295,73677,187,10545,580,0002,025,0002,265,088
3Feb 19, 2026 21:295,75574,318,52545,774,0001,990,0002,310,144
4Feb 19, 2026 21:295,75776,116,22344,793,0002,986,0002,523,136
5Feb 19, 2026 21:295,75873,770,26644,806,0002,987,0002,326,528
6Feb 19, 2026 21:295,75973,050,49343,815,0003,983,0002,265,088
7Feb 19, 2026 21:295,75973,546,27744,813,0002,987,0002,306,048
8Feb 19, 2026 21:295,75975,957,30843,818,0003,983,0002,310,144
9Feb 19, 2026 21:295,81371,692,08845,232,0003,015,0002,265,088