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 listAug 14, 2026 20:41Tomislav TunkovicTomislav TunkovicScore: 3,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 20:473,06633,365,01224,008,0001,136,0002,113,536
2Aug 14, 2026 20:473,07134,281,66224,068,0001,119,0002,113,536
3Aug 14, 2026 20:473,08033,623,22624,143,0001,118,0002,113,536
4Aug 14, 2026 20:473,09334,513,73224,229,0001,134,0002,113,536
5Aug 14, 2026 20:473,09434,421,43924,247,0001,129,0002,113,536
6Aug 14, 2026 20:473,09633,826,87024,273,0001,117,0002,113,536
7Aug 14, 2026 20:473,09733,824,08224,274,0001,122,0002,113,536
8Aug 14, 2026 20:473,10433,928,82624,438,0001,016,0002,113,536
9Aug 14, 2026 20:473,10533,908,71224,326,0001,136,0002,113,536