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 listJul 11, 2025 09:16Valentin KofmanValentin KofmanScore: 6,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2025 09:166,56178,512,29738,856,00014,944,0002,306,048
2Jul 11, 2025 09:166,86087,042,48841,184,00015,067,0002,338,816
3Jul 11, 2025 09:167,24086,508,67238,240,00021,132,0002,437,120