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:38Daniel MastalerzDaniel MastalerzScore: 5,660Success
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:385,55373,072,31743,088,0003,006,0002,318,336
2Feb 24, 2026 18:385,57367,637,71343,243,0003,017,0002,310,144
3Feb 24, 2026 18:385,58972,543,38543,364,0003,025,0002,310,144
4Feb 24, 2026 18:385,66070,683,85642,980,0003,998,0002,269,184
5Feb 24, 2026 18:385,66876,942,72443,041,0004,003,0002,273,280
6Feb 24, 2026 18:385,68470,362,23643,162,0004,015,0002,318,336