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 listMar 14, 2026 21:39Elijah KinElijah KinScore: 65,730Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 21:3965,415569,287,287349,614,000186,793,0002,301,952
2Mar 14, 2026 21:3965,730574,101,354342,992,000195,995,0002,310,144
3Mar 14, 2026 21:3965,905566,752,932337,637,000202,782,0002,301,952