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 listJun 11, 2021 19:37Yuriy LyfenkoYuriy LyfenkoScore: 124,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2021 19:3869,835636,529,539572,650,32902,289,664
2Jun 11, 2021 19:37110,192975,818,818903,572,37402,297,856
3Jun 11, 2021 19:38122,7871,069,352,0351,006,856,71202,285,568
4Jun 11, 2021 19:37123,2661,079,696,8571,010,781,82702,293,760
5Jun 11, 2021 19:37124,2101,076,726,8031,018,525,03702,273,280
6Jun 11, 2021 19:37124,8651,081,346,9011,023,889,88102,285,568
7Jun 11, 2021 19:38127,0821,105,310,4561,042,075,53202,293,760
8Jun 11, 2021 19:37134,5671,196,333,5071,103,448,02802,285,568
9Jun 11, 2021 19:37135,2021,169,350,8201,108,658,39502,281,472