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 9, 2025 19:43Valentin KofmanValentin KofmanScore: 7,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2025 19:436,78285,287,78334,377,00021,233,0002,396,160
2Jul 9, 2025 19:437,04686,581,07741,841,00015,939,0002,392,064
3Jul 9, 2025 19:437,25481,415,03739,318,00020,163,0002,465,792