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 15:57emily graceemily graceScore: 106,278Success
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 15:5798,525865,615,410807,903,84202,293,760
2Mar 28, 2024 15:57106,278931,950,976871,480,52402,297,856
3Mar 28, 2024 15:57119,5331,043,442,782980,171,98302,306,048