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:16AntonAntonScore: 32,052Success
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:1631,933289,154,325258,855,0002,998,0002,392,064
2Nov 4, 2025 23:1632,052290,078,430259,826,0002,997,0002,531,328
3Nov 4, 2025 23:1632,255293,281,147263,494,0001,001,0002,551,808