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 listSep 20, 2025 08:47sheryllynn24sheryllynn24Score: 10,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 08:4710,222113,925,58583,844,000998,0002,285,568
2Sep 20, 2025 08:4710,224114,657,00983,863,000998,0002,285,568
3Sep 20, 2025 08:4710,226110,523,25582,880,0001,997,0002,510,848
4Sep 20, 2025 08:4710,226113,968,13682,878,0001,997,0002,285,568
5Sep 20, 2025 08:4710,227116,098,19682,884,0001,997,0002,519,040
6Sep 20, 2025 08:4710,230108,750,42083,911,000998,0002,285,568
7Sep 20, 2025 08:4710,231109,041,82882,921,0001,998,0002,519,040
8Sep 20, 2025 08:4710,232115,194,92783,923,000999,0002,285,568
9Sep 20, 2025 08:4710,232111,413,77582,930,0001,998,0002,519,040
10Sep 20, 2025 08:4710,264111,822,51384,192,0001,002,0002,260,992
11Sep 20, 2025 08:4710,266111,298,66484,208,0001,002,0002,285,568
12Sep 20, 2025 08:4710,267112,432,47984,218,0001,002,0002,265,088