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 24, 2026 16:16spatialspatialScore: 95,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 16:1694,726812,749,664554,454,000231,771,0002,469,888
2Feb 24, 2026 16:1694,738819,324,286553,527,000232,801,0002,289,664
3Feb 24, 2026 16:1694,912812,836,123553,841,000233,932,0002,478,080
4Feb 24, 2026 16:1695,248823,367,088553,690,000236,867,0002,469,888
5Feb 24, 2026 16:1695,614815,745,840554,719,000238,879,0002,269,184
6Feb 24, 2026 16:1695,630820,416,116554,111,000239,615,0002,473,984
7Feb 24, 2026 16:1695,981819,485,052554,749,000241,890,0002,473,984
8Feb 24, 2026 16:1696,005823,222,344553,890,000242,951,0002,478,080
9Feb 24, 2026 16:1699,626848,996,104562,247,000264,645,0002,457,600