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 23, 2026 22:05Andrew EpsteinAndrew EpsteinScore: 25,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 22:0924,950214,480,669203,483,0001,113,0002,113,536
2Aug 23, 2026 22:0925,657220,299,157209,329,0001,066,0002,113,536
3Aug 23, 2026 22:0925,670220,380,849209,379,0001,121,0002,113,536
4Aug 23, 2026 22:0925,683220,442,300209,587,0001,020,0002,113,536
5Aug 23, 2026 22:0925,705220,611,041209,709,0001,080,0002,113,536
6Aug 23, 2026 22:0925,731220,812,491209,918,0001,080,0002,113,536
7Aug 23, 2026 22:0925,747220,999,802210,017,0001,109,0002,113,536
8Aug 23, 2026 22:0925,748220,982,125210,019,0001,116,0002,113,536
9Aug 23, 2026 22:0926,212224,863,343213,934,0001,012,0002,113,536