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 listJul 8, 2026 03:23Victor MerckléVictor MerckléScore: 2,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 03:242,86731,448,26822,381,0001,131,0002,117,632stderr
2Jul 8, 2026 03:242,87231,562,84722,426,0001,128,0002,117,632stderr
3Jul 8, 2026 03:242,89831,874,18422,727,0001,038,0002,117,632stderr
4Jul 8, 2026 03:242,91532,019,77422,770,0001,137,0002,117,632stderr
5Jul 8, 2026 03:242,97432,319,56923,310,0001,084,0002,117,632stderr
6Jul 8, 2026 03:2411,702104,056,22194,865,0001,096,0002,117,632stderr
7Jul 8, 2026 03:2411,716104,105,84194,967,0001,112,0002,117,632stderr
8Jul 8, 2026 03:2411,841104,951,99795,963,0001,136,0002,117,632stderr
9Jul 8, 2026 03:2412,131107,445,28998,468,0001,009,0002,117,632stderr