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:53Daniel MastalerzDaniel MastalerzScore: 6,375Success
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:536,25281,276,58248,895,0002,993,0002,310,144
2Feb 15, 2026 18:536,27382,419,28248,063,0004,005,0002,265,088
3Feb 15, 2026 18:536,32079,011,73550,438,0002,017,0002,326,528
4Feb 15, 2026 18:536,37574,813,36949,921,0002,995,0002,318,336
5Feb 15, 2026 18:536,40077,432,48650,114,0003,006,0002,269,184
6Feb 15, 2026 18:536,41380,279,57350,213,0003,012,0002,260,992