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 30, 2026 23:21Charles CabergsCharles CabergsScore: 4,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 23:224,67055,661,52337,289,0001,007,0002,363,392
2Apr 30, 2026 23:224,67654,134,75237,338,0001,009,0002,347,008
3Apr 30, 2026 23:224,67753,478,98435,331,0003,028,0002,375,680
4Apr 30, 2026 23:224,70355,959,81735,522,0003,044,0002,351,104
5Apr 30, 2026 23:224,73958,923,08137,869,000996,0002,375,680
6Apr 30, 2026 23:224,75655,052,48435,005,0004,000,0002,367,488
7Apr 30, 2026 23:229,637100,685,62977,031,0002,000,0002,387,968
8Apr 30, 2026 23:229,67295,149,22975,298,0004,015,0002,363,392
9Apr 30, 2026 23:229,69797,927,14576,499,0003,019,0002,494,464