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 17, 2026 23:54Daniel MastalerzDaniel MastalerzScore: 7,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 23:546,99580,995,30554,053,0004,003,0002,310,144
2Feb 17, 2026 23:546,99882,576,42055,078,0003,004,0002,326,528
3Feb 17, 2026 23:547,00181,717,50654,100,0004,007,0002,265,088
4Feb 17, 2026 23:547,13886,004,07956,232,0003,012,0002,310,144
5Feb 17, 2026 23:547,15080,889,99756,324,0003,017,0002,273,280
6Feb 17, 2026 23:547,16689,052,79255,448,0004,032,0002,285,568