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 listJun 26, 2026 07:58Zhou180Zhou180Score: 22,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 07:593,53038,150,77127,896,0001,058,0002,117,632
2Jun 26, 2026 07:593,56138,346,83728,160,0001,046,0002,117,632
3Jun 26, 2026 07:5921,563185,993,733174,811,0002,010,0002,117,632
4Jun 26, 2026 07:5921,906188,739,818177,625,0002,010,0002,117,632
5Jun 26, 2026 07:5922,134190,712,874178,483,0003,016,0002,117,632
6Jun 26, 2026 07:5922,208191,311,258180,104,0002,009,0002,117,632
7Jun 26, 2026 07:5922,446193,252,281182,053,0002,011,0002,117,632
8Jun 26, 2026 07:5922,725195,509,556183,317,0003,032,0002,117,632
9Jun 26, 2026 07:5922,739195,677,205184,452,0002,012,0002,117,632