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 19:30Daniel MastalerzDaniel MastalerzScore: 10,199Success
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 19:3010,002107,074,12681,015,0002,000,0002,523,136
2Feb 15, 2026 19:3010,047108,711,37280,378,0003,014,0002,297,856
3Feb 15, 2026 19:3010,065113,261,76181,526,0002,012,0002,273,280
4Feb 15, 2026 19:3010,199111,835,13883,641,0001,007,0002,289,664
5Feb 15, 2026 19:3010,240109,278,42182,995,0001,999,0002,273,280
6Feb 15, 2026 19:3010,252108,243,21683,090,0002,002,0002,289,664