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 listApr 15, 2026 21:12zielajzielajScore: 5,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 21:122,84444,428,55422,306,0001,013,0002,420,736
2Apr 15, 2026 21:152,85252,114,98121,350,0002,033,0002,359,296
3Apr 15, 2026 21:155,37268,176,65442,049,0002,002,0002,457,600
4Apr 15, 2026 21:155,39268,038,17541,197,0003,014,0002,281,472
5Apr 15, 2026 21:125,42068,907,10943,438,0001,010,0002,408,448
6Apr 15, 2026 21:125,42967,605,32041,480,0003,035,0002,281,472