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 8, 2025 23:09Valentin KofmanValentin KofmanScore: 7,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2025 23:097,11483,706,01143,246,00015,085,0002,269,184
2Jul 8, 2025 23:097,15989,063,77845,771,00012,935,0002,269,184
3Jul 8, 2025 23:097,27286,530,51638,406,00021,224,0002,486,272