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 21, 2024 14:02GabriellaGabriellaScore: 167,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2024 14:02167,2131,432,334,5191,371,144,30202,281,472
2Aug 21, 2024 14:04167,2691,443,708,8021,371,609,69502,285,568
3Aug 21, 2024 14:04167,9291,435,681,9531,377,015,70202,289,664
4Aug 21, 2024 14:02167,9741,438,302,9531,377,390,00202,289,664
5Aug 21, 2024 14:02168,8141,453,815,6391,384,271,82902,293,760
6Aug 21, 2024 14:04169,1611,456,492,5451,387,122,64002,306,048