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 12, 2026 10:48Victor MerckléVictor MerckléScore: 3,390Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 10:483,34634,837,31726,412,0001,028,0002,113,536
2Jun 12, 2026 10:483,36734,981,92426,544,0001,069,0002,113,536
3Jun 12, 2026 10:483,36834,979,80226,568,0001,056,0002,113,536
4Jun 12, 2026 10:483,37835,184,66826,668,0001,033,0002,113,536
5Jun 12, 2026 10:483,39035,221,23126,738,0001,066,0002,113,536
6Jun 12, 2026 10:483,40835,331,89126,899,0001,049,0002,113,536
7Jun 12, 2026 10:483,43135,507,37827,064,0001,072,0002,113,536
8Jun 12, 2026 10:486,53260,977,53152,553,0001,016,0002,113,536
9Jun 12, 2026 10:4813,069115,969,003105,155,0002,015,0002,113,536