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 listNov 19, 2025 17:57Yuriy LyfenkoYuriy LyfenkoScore: 3,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 19, 2025 17:573,878560,087,73528,821,0002,981,0002,469,888
2Nov 19, 2025 17:573,882557,280,08429,844,0001,989,0002,461,696
3Nov 19, 2025 17:573,885555,338,50629,867,0001,991,0002,433,024
4Nov 19, 2025 17:573,885561,131,40729,868,0001,991,0002,437,120
5Nov 19, 2025 17:573,889561,576,40829,895,0001,993,0002,355,200
6Nov 19, 2025 17:573,894561,022,32929,936,0001,995,0002,437,120
7Nov 19, 2025 17:573,909559,280,00730,051,0002,003,0002,301,952
8Nov 19, 2025 17:573,918561,072,13529,113,0003,011,0002,396,160
9Nov 19, 2025 17:573,971556,180,66532,559,00002,424,832