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 08:38Zhou180Zhou180Score: 22,097Success
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 08:413,48237,717,06827,517,0001,039,0002,117,632
2Jun 26, 2026 08:413,52138,740,38527,813,0001,062,0002,121,728
3Jun 26, 2026 08:4122,014189,681,436177,482,0003,036,0002,117,632
4Jun 26, 2026 08:4122,095190,338,354178,178,0003,005,0002,117,632
5Jun 26, 2026 08:4122,097190,363,643179,190,0002,012,0002,117,632
6Jun 26, 2026 08:4122,232191,509,836179,298,0003,005,0002,117,632
7Jun 26, 2026 08:4122,305192,068,929180,891,0002,011,0002,117,632
8Jun 26, 2026 08:4122,510193,727,853182,570,0002,012,0002,117,632
9Jun 26, 2026 08:4122,606194,602,475182,335,0003,040,0002,117,632