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 15, 2026 18:49Daniel MastalerzDaniel MastalerzScore: 6,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 18:496,78582,901,98353,302,0003,017,0002,326,528
2Feb 15, 2026 18:496,79983,234,18652,404,0004,031,0002,269,184
3Feb 15, 2026 18:496,80085,084,13152,410,0004,031,0002,523,136
4Feb 15, 2026 18:496,90082,466,18255,261,0002,009,0002,519,040
5Feb 15, 2026 18:496,92280,564,33655,435,0002,015,0002,318,336
6Feb 15, 2026 18:496,93280,797,23954,505,0003,028,0002,306,048