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 4, 2025 13:11NoSIMD_C#NoSIMD_C#Score: 1,897,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2025 13:111,791,74614,723,765,38214,560,399,000131,922,0002,449,408
2Apr 4, 2025 13:111,897,40015,593,027,61815,429,770,000128,914,0002,342,912
3Apr 4, 2025 13:111,904,96815,657,325,63815,483,817,000136,918,0002,297,856