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 2, 2026 23:22olliecrowolliecrowScore: 6,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 23:225,84073,978,51743,426,0005,049,0002,310,144
2Feb 2, 2026 23:225,84086,108,92042,416,0006,059,0002,330,624
3Feb 2, 2026 23:225,95672,644,55744,390,0005,044,0002,506,752
4Feb 2, 2026 23:226,37080,800,44346,890,0005,985,0002,355,200
5Feb 2, 2026 23:226,41379,388,75851,222,0002,008,0002,379,776
6Feb 2, 2026 23:226,44078,895,53643,369,00010,085,0002,314,240