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 25, 2026 07:26limanjun99limanjun99Score: 4,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 07:264,38155,353,76632,936,0002,994,0002,531,328
2Apr 25, 2026 07:264,48358,352,28234,779,0001,987,0002,486,272
3Apr 25, 2026 07:264,49954,214,50833,906,0002,991,0002,351,104
4Apr 25, 2026 07:264,50954,060,10533,978,0002,998,0002,547,712
5Apr 25, 2026 07:264,51752,788,26234,044,0003,003,0002,506,752
6Apr 25, 2026 07:264,54253,331,42634,228,0003,020,0002,490,368
7Apr 25, 2026 07:264,54856,043,57234,273,0003,024,0002,469,888
8Apr 25, 2026 07:264,55455,373,15234,320,0003,028,0002,469,888
9Apr 25, 2026 07:264,60458,299,31933,673,0004,081,0002,461,696