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 listDec 27, 2025 12:14Rajarshi BasuRajarshi BasuScore: 11,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 12:1411,475120,059,44687,089,0007,007,0002,527,232
2Dec 27, 2025 12:1411,632117,602,87689,360,0006,024,0002,527,232
3Dec 27, 2025 12:1411,777123,365,66189,533,0007,041,0002,486,272