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 23, 2026 00:39Charles CabergsCharles CabergsScore: 5,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 00:405,42365,510,89142,450,0002,021,0002,367,488
2Apr 23, 2026 00:405,48362,836,38741,967,0002,997,0002,371,584
3Apr 23, 2026 00:405,50060,377,26842,096,0003,006,0002,375,680
4Apr 23, 2026 00:405,51261,329,41739,176,0006,027,0002,535,424
5Apr 23, 2026 00:405,52066,208,46542,248,0003,017,0002,371,584
6Apr 23, 2026 00:405,55064,055,67441,465,0004,045,0002,326,528
7Apr 23, 2026 00:405,55764,494,54441,518,0004,050,0002,359,296
8Apr 23, 2026 00:405,57563,467,56842,741,0002,981,0002,392,064
9Apr 23, 2026 00:405,58564,129,39440,826,0004,978,0002,371,584