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 20:33Valentin KofmanValentin KofmanScore: 5,477Success
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 20:335,38070,723,77933,084,00011,028,0002,347,008
2Jul 9, 2025 20:335,47773,236,15432,937,00011,977,0002,420,736
3Jul 9, 2025 20:335,49168,377,19632,018,00013,007,0002,326,528