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 listMay 1, 2026 21:56Mehdi-Dehghan-FooladiMehdi-Dehghan-FooladiScore: 64,744Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 21:5763,533542,366,104347,984,000172,992,0002,359,296
2May 1, 2026 21:5764,418547,120,730348,491,000179,737,0002,408,448
3May 1, 2026 21:5764,679546,908,687352,581,000177,788,0002,408,448
4May 1, 2026 21:5764,707554,652,655355,733,000174,869,0002,416,640
5May 1, 2026 21:5764,744548,762,451354,937,000175,969,0002,465,792
6May 1, 2026 21:5764,844547,244,887347,820,000183,905,0002,404,352
7May 1, 2026 21:5764,890549,288,093353,068,000179,034,0002,400,256
8May 1, 2026 21:5765,227554,749,295350,911,000183,953,0002,408,448
9May 1, 2026 21:5765,498561,159,604358,056,000179,028,0002,383,872