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 10, 2026 22:06olliecrowolliecrowScore: 3,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 22:063,47157,177,82725,410,0003,049,0002,351,104
2Mar 10, 2026 22:063,49359,879,65926,600,0002,046,0002,519,040
3Mar 10, 2026 22:063,51753,638,07126,848,0001,988,0002,510,848
4Mar 10, 2026 22:063,51754,302,41723,866,0004,972,0002,523,136
5Mar 10, 2026 22:063,51754,952,39926,853,0001,989,0002,351,104
6Mar 10, 2026 22:0618,521178,662,756149,877,0001,998,0002,334,720
7Mar 10, 2026 22:0618,526175,452,938149,913,0001,998,0002,342,912
8Mar 10, 2026 22:0618,544180,366,838147,058,0005,002,0002,289,664
9Mar 10, 2026 22:0618,557173,917,756150,164,0002,002,0002,424,832