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 25, 2026 15:51Zhou180Zhou180Score: 6,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 15:526,43761,952,59250,617,0002,172,0002,117,632
2Jun 25, 2026 15:526,50662,476,11651,167,0002,185,0002,117,632
3Jun 25, 2026 15:526,50862,525,42151,160,0002,211,0002,117,632
4Jun 25, 2026 15:526,59563,248,14951,885,0002,200,0002,117,632
5Jun 25, 2026 15:526,62163,417,04552,055,0002,243,0002,117,632
6Jun 25, 2026 15:526,66773,593,45352,608,0002,067,0002,121,728
7Jun 25, 2026 15:526,67464,298,98952,392,0002,336,0002,117,632
8Jun 25, 2026 15:526,68573,512,36552,503,0002,322,0002,117,632
9Jun 25, 2026 15:526,71272,538,27953,022,0002,023,0002,121,728