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 listNov 8, 2024 17:59Alexey TarasovAlexey TarasovScore: 73,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2024 17:5973,522634,133,385610,230,00002,285,568
2Nov 8, 2024 17:5873,539636,640,068609,376,0001,000,0002,293,760
3Nov 8, 2024 17:5873,565638,826,604608,594,0001,998,0002,371,584
4Nov 8, 2024 17:5973,624635,686,926610,083,0001,000,0002,293,760
5Nov 8, 2024 17:5873,680643,278,303609,544,0001,998,0002,379,776
6Nov 8, 2024 17:5973,708648,777,766609,778,0001,999,0002,371,584