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 8, 2026 06:42caandocaandoScore: 8,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 06:427,71686,596,15862,039,0002,001,0002,285,568
2Mar 8, 2026 06:427,71785,139,31362,049,0002,001,0002,285,568
3Mar 8, 2026 06:427,73786,644,49662,212,0002,006,0002,523,136
4Mar 8, 2026 06:428,67094,724,35069,965,0001,999,0002,277,376
5Mar 8, 2026 06:428,67093,941,85970,961,000999,0002,285,568
6Mar 8, 2026 06:428,68298,467,65470,057,0002,001,0002,285,568