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 listJan 22, 2025 22:45Oleg KovalovOleg KovalovScore: 70,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 22:4565,759574,078,251347,502,000191,725,0002,342,912
2Jan 22, 2025 22:4568,235585,687,398371,687,000187,842,0002,310,144
3Jan 22, 2025 22:4568,334586,683,444373,557,000186,778,0002,301,952
4Jan 22, 2025 22:4569,774599,173,376376,095,000196,049,0002,301,952
5Jan 22, 2025 22:4570,242604,778,176385,987,000189,994,0002,297,856
6Jan 22, 2025 22:4571,170607,382,242385,731,000197,862,0002,441,216
7Jan 22, 2025 22:4572,461621,673,817414,127,000180,055,0002,306,048
8Jan 22, 2025 22:4578,788673,482,621458,332,000187,726,0002,420,736
9Jan 22, 2025 22:4582,343704,361,082478,445,000196,771,0002,490,368