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 18, 2026 00:03Daniel MastalerzDaniel MastalerzScore: 6,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 00:036,40373,645,15650,136,0003,008,0002,330,624
2Feb 18, 2026 00:036,41478,362,33149,216,0004,017,0002,375,680
3Feb 18, 2026 00:036,43177,057,55548,343,0005,035,0002,318,336
4Feb 18, 2026 00:036,51081,426,93850,035,0004,002,0002,306,048
5Feb 18, 2026 00:036,52376,568,65249,127,0005,013,0002,273,280
6Feb 18, 2026 00:036,53979,826,03449,246,0005,025,0002,269,184