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 21, 2026 23:00Mathaus Adorno PereiraMathaus Adorno PereiraScore: 242,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 23:00242,4472,037,596,7502,009,309,0002,998,0002,330,624
2Feb 21, 2026 23:00242,4702,040,621,8022,010,502,0001,999,0002,330,624
3Feb 21, 2026 23:00242,4852,041,716,2172,009,626,0002,997,0002,330,624
4Feb 21, 2026 23:00242,4962,039,829,9252,010,715,0001,998,0002,330,624
5Feb 21, 2026 23:00242,5102,043,087,1202,009,831,0002,998,0002,322,432
6Feb 21, 2026 23:00242,5222,039,255,0702,010,931,0001,998,0002,330,624
7Feb 21, 2026 23:00242,5422,037,077,6522,008,101,0004,997,0002,322,432
8Feb 21, 2026 23:00242,6162,043,964,6312,011,718,0001,998,0002,330,624
9Feb 21, 2026 23:00243,1442,047,437,1552,016,095,0001,999,0002,322,432