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 listMar 4, 2026 06:05olliecrowolliecrowScore: 18,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 06:0518,138176,159,647146,739,0001,996,0002,441,216
2Mar 4, 2026 06:0518,308170,516,280148,123,0002,001,0002,449,408
3Mar 4, 2026 06:0518,584178,362,077151,389,0001,002,0002,437,120