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 24, 2026 18:53Daniel MastalerzDaniel MastalerzScore: 5,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 18:535,51774,319,78341,808,0003,981,0002,326,528
2Feb 24, 2026 18:535,52173,997,20142,837,0002,988,0002,514,944
3Feb 24, 2026 18:535,53371,123,70141,932,0003,993,0002,314,240
4Feb 24, 2026 18:535,57668,280,46342,255,0004,024,0002,310,144
5Feb 24, 2026 18:535,60267,311,42843,464,0003,032,0002,260,992
6Feb 24, 2026 18:535,64976,818,53042,898,0003,990,0002,269,184