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:15AntonAntonScore: 31,792Success
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:1531,506281,092,663257,346,0001,001,0002,301,952
2Nov 4, 2025 23:1531,792285,017,570257,701,0002,996,0002,351,104
3Nov 4, 2025 23:1531,938286,709,586259,894,0001,999,0002,519,040