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 08:46Valentin KofmanValentin KofmanScore: 6,879Success
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 08:466,80383,524,58336,860,00018,928,0002,318,336
2Jul 11, 2025 08:466,87982,305,87742,308,00014,102,0002,457,600
3Jul 11, 2025 08:467,11681,407,09139,239,00019,116,0002,433,024