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 4, 2025 23:02AntonAntonScore: 33,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 23:0231,362282,527,305254,166,0003,001,0002,408,448
2Nov 4, 2025 23:0233,213299,996,824271,343,0001,001,0002,424,832
3Nov 4, 2025 23:0233,443300,230,263273,229,0001,000,0002,424,832