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 listMar 6, 2026 18:20wnwnScore: 4,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 18:214,33860,822,33534,003,0002,000,0002,494,464
2Mar 6, 2026 18:214,34362,170,93734,042,0002,002,0002,273,280
3Mar 6, 2026 18:214,34462,623,32334,051,0002,003,0002,273,280
4Mar 6, 2026 18:214,34554,751,23534,057,0002,003,0002,494,464
5Mar 6, 2026 18:204,34762,628,10034,074,0002,004,0002,273,280
6Mar 6, 2026 18:204,36456,926,59734,211,0002,012,0002,273,280
7Mar 6, 2026 18:224,37056,898,99935,265,0001,007,0002,273,280
8Mar 6, 2026 18:224,37261,707,45435,282,0001,008,0002,490,368
9Mar 6, 2026 18:214,37360,589,89135,288,0001,008,0002,490,368
10Mar 6, 2026 18:204,93663,811,02238,971,0001,998,0002,494,464
11Mar 6, 2026 18:224,94662,419,50539,052,0002,002,0002,531,328
12Mar 6, 2026 18:2110,718110,412,39986,959,0001,999,0002,490,368