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 21:49Victor MerckléVictor MerckléScore: 3,078Success
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 21:503,00832,286,91123,571,0001,102,0002,113,536
2Jun 23, 2026 21:503,03832,515,21723,802,0001,113,0002,113,536
3Jun 23, 2026 21:503,06632,720,56924,117,0001,032,0002,113,536
4Jun 23, 2026 21:503,07732,657,34324,076,0001,156,0002,113,536
5Jun 23, 2026 21:503,07832,878,54624,050,0001,190,0002,113,536
6Jun 23, 2026 21:503,08032,868,49724,059,0001,198,0002,113,536
7Jun 23, 2026 21:503,13133,292,46024,467,0001,213,0002,113,536
8Jun 23, 2026 21:5012,146108,901,32198,592,0001,009,0002,113,536
9Jun 23, 2026 21:5012,693111,670,167103,078,0001,009,0002,113,536