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:15Zhou180Zhou180Score: 21,979Success
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:163,58038,569,83028,322,0001,037,0002,117,632
2Jun 26, 2026 07:163,64139,057,89828,814,0001,048,0002,117,632
3Jun 26, 2026 07:1621,308183,962,234172,720,0002,011,0002,117,632
4Jun 26, 2026 07:1621,657186,740,673175,583,0002,012,0002,117,632
5Jun 26, 2026 07:1621,979189,354,406178,221,0002,011,0002,117,632
6Jun 26, 2026 07:1622,005189,580,500178,436,0002,011,0002,117,632
7Jun 26, 2026 07:1622,067190,171,604178,940,0002,012,0002,117,632
8Jun 26, 2026 07:1622,383192,711,227180,520,0003,025,0002,117,632
9Jun 26, 2026 07:1622,541194,047,408182,827,0002,011,0002,117,632