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:10Zhou180Zhou180Score: 21,829Success
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:113,66739,213,95829,031,0001,043,0002,117,632
2Jun 26, 2026 07:113,71639,626,80829,440,0001,035,0002,117,632
3Jun 26, 2026 07:1121,126182,538,899171,225,0002,012,0002,117,632
4Jun 26, 2026 07:1121,452185,013,164173,896,0002,011,0002,117,632
5Jun 26, 2026 07:1121,829188,184,318175,977,0003,024,0002,117,632
6Jun 26, 2026 07:1121,882188,574,777176,329,0003,105,0002,117,632
7Jun 26, 2026 07:1121,913188,942,934176,625,0003,068,0002,117,632
8Jun 26, 2026 07:1122,093190,378,415178,107,0003,062,0002,117,632
9Jun 26, 2026 07:1122,346192,423,803180,172,0003,073,0002,117,632