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 23, 2026 23:38Victor MerckléVictor MerckléScore: 12,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 23:393,17034,053,68524,804,0001,190,0002,113,536
2Jun 23, 2026 23:393,19633,824,85524,986,0001,223,0002,113,536
3Jun 23, 2026 23:393,23034,421,30025,293,0001,195,0002,113,536
4Jun 23, 2026 23:3912,123107,044,19298,407,0001,009,0002,113,536
5Jun 23, 2026 23:3912,126107,063,78498,425,0001,009,0002,113,536
6Jun 23, 2026 23:3912,168107,460,50398,770,0001,008,0002,113,536
7Jun 23, 2026 23:3912,184107,564,24698,902,0001,010,0002,113,536
8Jun 23, 2026 23:3912,185107,565,95998,913,0001,008,0002,113,536
9Jun 23, 2026 23:3912,203108,085,54999,057,0001,012,0002,113,536