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:02Daniel MastalerzDaniel MastalerzScore: 7,330Success
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:027,19983,148,17857,727,0002,025,0002,269,184
2Feb 15, 2026 19:027,20588,814,73256,814,0002,990,0002,301,952
3Feb 15, 2026 19:027,28789,608,14459,473,0001,008,0002,273,280
4Feb 15, 2026 19:027,33082,141,92859,839,000997,0002,260,992
5Feb 15, 2026 19:027,33487,888,62158,877,0001,995,0002,269,184
6Feb 15, 2026 19:027,33989,741,38658,916,0001,997,0002,293,760