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:51Zhou180Zhou180Score: 21,450Success
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:523,52938,032,45527,900,0001,044,0002,117,632
2Jun 26, 2026 07:523,53138,046,83527,899,0001,057,0002,117,632
3Jun 26, 2026 07:523,55738,314,95828,102,0001,069,0002,117,632
4Jun 26, 2026 07:5221,301183,836,598172,658,0002,011,0002,117,632
5Jun 26, 2026 07:5221,450184,984,372172,854,0003,042,0002,117,632
6Jun 26, 2026 07:5221,491185,415,199174,220,0002,012,0002,117,632
7Jun 26, 2026 07:5221,569186,056,661174,857,0002,013,0002,117,632
8Jun 26, 2026 07:5221,615186,386,858175,236,0002,012,0002,117,632
9Jun 26, 2026 07:5222,270191,743,512180,601,0002,013,0002,117,632