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:25Zhou180Zhou180Score: 21,766Success
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:273,60538,693,89728,520,0001,046,0002,117,632
2Jun 26, 2026 07:273,62639,007,91428,694,0001,044,0002,117,632
3Jun 26, 2026 07:273,63640,424,65528,749,0001,070,0002,117,632
4Jun 26, 2026 07:2721,251183,482,866171,225,0003,039,0002,117,632
5Jun 26, 2026 07:2721,766187,631,401176,474,0002,013,0002,117,632
6Jun 26, 2026 07:2721,784187,905,008175,607,0003,022,0002,117,632
7Jun 26, 2026 07:2722,109190,579,331178,255,0003,045,0002,117,632
8Jun 26, 2026 07:2722,241191,520,452180,369,0002,013,0002,117,632
9Jun 26, 2026 07:2722,265191,794,582180,566,0002,011,0002,117,632