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 20, 2026 04:16olliecrowolliecrowScore: 3,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 04:163,44149,186,63627,212,0001,007,0002,404,352
2Mar 20, 2026 04:163,49258,058,48528,631,00002,400,256
3Mar 20, 2026 04:1623,065212,681,112183,129,0006,004,0002,273,280