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:42Zhou180Zhou180Score: 21,820Success
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:433,56538,333,49628,197,0001,044,0002,117,632
2Jun 26, 2026 07:4320,794179,659,038167,479,0003,037,0002,117,632
3Jun 26, 2026 07:4321,360184,299,056172,150,0003,008,0002,117,632
4Jun 26, 2026 07:4321,648186,671,628174,515,0003,003,0002,117,632
5Jun 26, 2026 07:4321,820188,229,089175,874,0003,058,0002,117,632
6Jun 26, 2026 07:4321,835188,200,717177,040,0002,013,0002,117,632
7Jun 26, 2026 07:4321,885188,617,336177,452,0002,011,0002,117,632
8Jun 26, 2026 07:4321,950189,189,252177,980,0002,013,0002,117,632
9Jun 26, 2026 07:4322,721195,506,328183,278,0003,035,0002,117,632