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 listAug 23, 2026 17:40Victor MerckléVictor MerckléScore: 5,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 17:422,73130,718,53821,307,0001,092,0002,117,632stderr
2Aug 23, 2026 17:422,77031,114,28821,690,0001,024,0002,117,632stderr
3Aug 23, 2026 17:422,77531,783,37621,733,0001,030,0002,117,632stderr
4Aug 23, 2026 17:425,39552,590,88443,127,0001,113,0002,117,632stderr
5Aug 23, 2026 17:425,40452,690,91443,166,0001,153,0002,117,632stderr
6Aug 23, 2026 17:425,43152,880,85443,476,0001,061,0002,117,632stderr
7Aug 23, 2026 17:425,44354,425,92743,495,0001,139,0002,117,632stderr
8Aug 23, 2026 17:425,48553,441,04243,966,0001,019,0002,117,632stderr
9Aug 23, 2026 17:425,56253,968,54744,596,0001,017,0002,117,632stderr