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 28, 2025 06:53KeefeKeefeScore: 19,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2025 06:5319,103179,166,977155,642,0001,004,0002,289,664
2Apr 28, 2025 06:5319,104183,765,508155,657,000997,0002,506,752
3Apr 28, 2025 06:5319,126179,735,138155,836,000998,0002,359,296
4Apr 28, 2025 06:5319,131183,439,935155,873,000999,0002,289,664
5Apr 28, 2025 06:5319,132177,843,194156,883,00002,289,664
6Apr 28, 2025 06:5319,141180,408,810155,961,000999,0002,289,664
7Apr 28, 2025 06:5319,142180,571,599155,962,000999,0002,510,848
8Apr 28, 2025 06:5319,149179,542,266157,022,00002,506,752
9Apr 28, 2025 06:5319,191180,262,573156,362,0001,002,0002,510,848