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 10, 2026 19:27Daniel MastalerzDaniel MastalerzScore: 8,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 19:278,69593,558,35970,162,0002,004,0002,273,280
2Feb 10, 2026 19:278,76298,002,82364,754,0007,969,0002,318,336
3Feb 10, 2026 19:278,77093,849,33066,726,0006,066,0002,318,336
4Feb 10, 2026 19:278,85396,511,26672,477,0001,006,0002,306,048
5Feb 10, 2026 19:278,888104,519,40768,784,0004,984,0002,285,568
6Feb 10, 2026 19:278,888100,634,58169,787,0003,987,0002,318,336