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 20, 2026 02:23Serhii SakhnoSerhii SakhnoScore: 72,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 02:2372,811632,985,484603,337,000998,0002,330,624
2Feb 20, 2026 02:2172,832629,950,595602,510,0001,998,0002,293,760
3Feb 20, 2026 02:2372,846628,873,551602,621,0001,998,0002,269,184
4Feb 20, 2026 02:2372,853628,634,522603,680,000999,0002,293,760
5Feb 20, 2026 02:2372,904627,427,881604,103,0001,000,0002,293,760
6Feb 20, 2026 02:2172,931630,813,623603,323,0002,001,0002,289,664
7Feb 20, 2026 02:2372,954633,350,741605,516,00002,285,568
8Feb 20, 2026 02:2372,955633,499,755604,528,000999,0002,293,760
9Feb 20, 2026 02:2372,977628,670,470603,707,0001,999,0002,293,760
10Feb 20, 2026 02:2373,056628,946,441604,371,0001,997,0002,293,760
11Feb 20, 2026 02:2373,081634,882,110604,573,0001,998,0002,293,760
12Feb 20, 2026 02:2173,166634,224,950605,280,0001,997,0002,285,568