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 listJan 2, 2026 05:29Rajarshi BasuRajarshi BasuScore: 11,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 05:2911,300119,336,60476,722,00015,942,0002,527,232
2Jan 2, 2026 05:2911,943121,149,97282,940,00014,989,0002,301,952
3Jan 2, 2026 05:2995,992816,784,955650,283,000136,849,0002,465,792