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 listAug 2, 2026 21:44TonyTonyScore: 1,007,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 21:461,000,2218,212,156,4538,046,781,000155,037,0002,113,536
2Aug 2, 2026 21:461,002,7868,233,750,0428,067,594,000155,255,0002,113,536
3Aug 2, 2026 21:461,003,6148,239,837,7728,072,495,000157,140,0002,113,536
4Aug 2, 2026 21:461,007,3948,270,954,2288,105,554,000155,078,0002,113,536
5Aug 2, 2026 21:461,007,4278,271,730,1458,105,328,000155,576,0002,113,536
6Aug 2, 2026 21:461,008,2488,278,258,1318,110,631,000157,006,0002,113,536
7Aug 2, 2026 21:461,008,6558,281,692,1438,116,217,000154,758,0002,113,536
8Aug 2, 2026 21:461,008,7028,281,911,2338,116,342,000155,021,0002,113,536
9Aug 2, 2026 21:461,012,1738,310,611,6398,144,367,000155,456,0002,113,536