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:44NoSIMD_C#NoSIMD_C#Score: 302,478Success
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:44224,6251,863,884,9871,739,982,000101,940,0002,330,624
2Apr 4, 2025 13:44279,8112,320,843,5122,186,523,000107,927,0002,473,984
3Apr 4, 2025 13:44281,5002,339,232,0702,207,371,000100,925,0002,469,888
4Apr 4, 2025 13:44302,4232,505,248,5232,373,914,000105,951,0002,301,952
5Apr 4, 2025 13:44302,4782,506,291,0272,374,392,000105,928,0002,473,984
6Apr 4, 2025 13:44313,3372,595,022,7592,467,429,000101,935,0002,482,176
7Apr 4, 2025 13:44357,4142,962,655,4462,823,877,000106,919,0002,293,760
8Apr 4, 2025 13:44366,1283,031,463,4262,889,319,000112,934,0002,273,280
9Apr 4, 2025 13:44504,6554,163,597,6664,031,246,000106,926,0002,473,984