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 7, 2026 08:39Petsku01Petsku01Score: 60,164Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 08:3960,144523,060,256498,193,0001,000,0002,523,136
2Jan 7, 2026 10:1060,151521,422,737498,251,0001,000,0002,265,088
3Jan 7, 2026 08:3960,152526,873,032498,259,0001,000,0002,510,848
4Jan 7, 2026 08:3960,152526,170,540497,258,0002,001,0002,277,376
5Jan 7, 2026 08:3960,158523,549,152499,312,00002,293,760
6Jan 7, 2026 10:1060,161521,382,183496,334,0003,002,0002,379,776
7Jan 7, 2026 08:3960,164526,909,585496,367,0002,996,0002,523,136
8Jan 7, 2026 08:3960,169530,969,899498,400,0001,000,0002,277,376
9Jan 7, 2026 08:3960,193528,172,185497,600,0001,998,0002,277,376
10Jan 7, 2026 10:1060,212531,085,969496,763,0002,998,0002,277,376
11Jan 7, 2026 08:3960,227525,760,225497,886,0001,999,0002,277,376
12Jan 7, 2026 08:3960,251525,078,577499,082,0001,000,0002,519,040