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 29, 2026 00:41olliecrowolliecrowScore: 3,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 00:423,37345,518,08326,636,0001,024,0002,523,136
2Apr 29, 2026 00:423,39344,725,60625,836,0001,987,0002,527,232
3Apr 29, 2026 00:423,41542,231,81825,005,0003,000,0002,396,160
4Apr 29, 2026 00:423,42446,736,87825,072,0003,008,0002,469,888
5Apr 29, 2026 00:423,45744,638,34826,325,0002,025,0002,375,680
6Apr 29, 2026 00:423,50548,076,74725,775,0002,974,0002,412,544
7Apr 29, 2026 00:4223,958212,571,101195,456,0001,002,0002,502,656
8Apr 29, 2026 00:4224,030216,559,716194,048,0003,000,0002,465,792
9Apr 29, 2026 00:4224,097218,324,716194,606,0002,993,0002,314,240