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 listJan 18, 2026 07:14Josu San MartinJosu San MartinScore: 8,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 07:148,39197,979,17667,806,000997,0002,514,944
2Jan 18, 2026 07:148,40597,142,11268,924,00002,441,216
3Jan 18, 2026 07:148,43998,683,04067,195,0002,005,0002,461,696