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 22, 2025 20:30Adam FolwarcznyAdam FolwarcznyScore: 87,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 20:3084,914722,638,071577,415,000118,879,0002,281,472
2Jun 22, 2025 20:3085,447727,703,793574,724,000125,939,0002,506,752
3Jun 22, 2025 20:3086,783738,387,026591,688,000119,936,0002,277,376
4Jun 22, 2025 20:3086,817744,549,935599,915,000111,984,0002,297,856
5Jun 22, 2025 20:3087,300744,411,828582,883,000132,973,0002,297,856
6Jun 22, 2025 20:3087,306741,794,463598,924,000116,985,0002,301,952
7Jun 22, 2025 20:3089,266755,111,727618,982,000112,996,0002,424,832
8Jun 22, 2025 20:3089,469760,394,525625,696,000107,947,0002,293,760
9Jun 22, 2025 20:3089,749758,933,114619,952,000115,991,0002,301,952