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 22, 2025 10:42NoSIMD_C#NoSIMD_C#Score: 462,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 10:42257,1072,136,530,7132,042,298,00065,977,0002,461,696
2Apr 22, 2025 10:42462,9383,822,210,0823,730,127,00065,966,0002,322,432
3Apr 22, 2025 10:42475,6763,928,137,8933,835,583,00064,959,0002,326,528