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 14:27NoSIMD_C#NoSIMD_C#Score: 312,410Success
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 14:27187,6531,567,450,1521,430,846,000107,912,0002,555,904
2Apr 4, 2025 14:27275,6832,286,163,2342,144,672,000115,928,0002,277,376
3Apr 4, 2025 14:27275,9392,292,246,6102,148,763,000113,934,0002,465,792
4Apr 4, 2025 14:27288,4672,395,928,3862,217,531,000147,902,0002,547,712
5Apr 4, 2025 14:27312,4102,586,810,7092,447,814,000113,944,0002,277,376
6Apr 4, 2025 14:27341,4082,823,099,6192,694,598,000104,945,0002,457,600
7Apr 4, 2025 14:27384,9673,187,194,0003,041,813,000114,917,0002,465,792
8Apr 4, 2025 14:27393,8923,257,163,3843,121,987,000107,930,0002,314,240
9Apr 4, 2025 14:27426,5493,522,579,2433,387,773,000109,927,0002,441,216