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 22:47olliecrowolliecrowScore: 12,235Success
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 22:4712,196126,466,17498,007,0002,000,0002,424,832
2Mar 4, 2026 22:4712,235128,641,32798,317,0002,006,0002,441,216
3Mar 4, 2026 22:4712,238130,389,62998,346,0002,007,0002,416,640