Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listMar 28, 2024 23:04woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 106,249Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2024 23:0495,928857,886,689786,610,56902,265,088
2Mar 28, 2024 23:04106,249947,222,515871,240,72102,203,648
3Mar 28, 2024 23:04112,693989,924,845924,084,68802,301,952