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 20, 2026 16:35Daniel MastalerzDaniel MastalerzScore: 5,833Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 16:355,73977,516,88145,606,0002,026,0002,269,184
2Feb 20, 2026 16:355,75575,094,69044,781,0002,985,0002,265,088
3Feb 20, 2026 16:355,75774,944,76545,792,0001,990,0002,289,664
4Feb 20, 2026 16:355,83375,514,65445,386,0003,025,0002,306,048
5Feb 20, 2026 16:355,84074,171,95545,445,0003,029,0002,318,336
6Feb 20, 2026 16:355,84367,047,18146,481,0002,020,0002,269,184