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 listJun 20, 2026 18:03A_ShamanA_ShamanScore: 37,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 18:0437,470316,340,437124,794,000182,461,0002,113,536
2Jun 20, 2026 18:0437,518316,784,674125,419,000182,233,0002,113,536
3Jun 20, 2026 18:0437,574317,516,372125,405,000182,703,0002,113,536