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 listJul 26, 2024 00:11IhebIhebScore: 369,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2024 00:11369,6523,094,957,3343,031,148,63302,224,128
2Jul 26, 2024 00:11369,8923,127,494,8483,033,115,86102,392,064
3Jul 26, 2024 00:11370,1353,094,300,9783,035,109,06002,269,184