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 listJan 3, 2026 16:12Carlos MGCarlos MGScore: 77,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 16:1277,383670,303,215640,281,0002,000,0002,322,432
2Jan 3, 2026 16:1277,384671,053,436642,284,00002,318,336
3Jan 3, 2026 16:1277,391669,287,813640,342,0002,001,0002,437,120
4Jan 3, 2026 16:1277,405674,319,209640,461,0001,998,0002,330,624
5Jan 3, 2026 16:1277,414674,353,896639,536,0002,997,0002,330,624
6Jan 3, 2026 16:1277,416672,109,959640,555,0001,998,0002,330,624
7Jan 3, 2026 16:1277,427667,031,325639,645,0002,998,0002,330,624
8Jan 3, 2026 16:1277,441670,885,666640,761,0001,999,0002,330,624
9Jan 3, 2026 16:1277,448673,119,821640,818,0001,999,0002,330,624