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:45NoSIMD_C#NoSIMD_C#Score: 374,036Success
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:45346,5572,872,848,4702,785,793,00055,975,0002,519,040
2Apr 22, 2025 10:45374,0363,094,740,9283,005,133,00061,961,0002,408,448
3Apr 22, 2025 10:45423,8673,500,115,5873,411,755,00063,957,0002,531,328