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 25, 2024 12:35Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 25, 2024 12:3400000Error: No answer to stdout. Died or killed?stderr
2Dec 25, 2024 12:354,27258,767,39733,028,0002,001,0002,502,656
3Dec 25, 2024 12:354,28761,452,43334,147,0001,004,0002,416,640
4Dec 25, 2024 12:354,31055,549,21933,322,0002,019,0002,527,232
5Dec 25, 2024 12:354,32754,393,38933,454,0002,027,0002,498,560
6Dec 25, 2024 12:354,35556,754,41233,730,0001,984,0002,527,232
7Dec 25, 2024 12:354,41558,760,91532,184,0004,023,0002,527,232