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 listApr 25, 2026 08:04limanjun99limanjun99Score: 4,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 08:054,03350,333,65231,067,0002,004,0002,347,008
2Apr 25, 2026 08:054,11646,735,56330,775,0002,978,0002,400,256
3Apr 25, 2026 08:054,12356,746,76029,837,0003,978,0002,322,432