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 24, 2025 10:27Emanuele BolognesiEmanuele BolognesiScore: 585,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2025 10:27577,3276,862,695,4743,954,037,000780,048,0002,478,080
2Apr 24, 2025 10:27584,5247,109,391,0763,919,899,000873,200,0002,363,392
3Apr 24, 2025 10:27584,7437,187,279,2263,937,414,000857,476,0002,514,944
4Apr 24, 2025 10:27584,9877,252,210,3513,914,499,000882,395,0002,519,040
5Apr 24, 2025 10:27585,3317,087,040,1313,928,657,000871,059,0002,420,736
6Apr 24, 2025 10:27585,3447,116,369,7233,958,292,000841,526,0002,490,368
7Apr 24, 2025 10:27590,7807,223,700,0693,954,321,000890,072,0002,269,184
8Apr 24, 2025 10:27591,0117,375,230,2643,922,276,000924,012,0002,334,720
9Apr 24, 2025 10:27592,9257,483,802,1693,938,736,000923,250,0002,285,568