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 listJul 1, 2025 20:59Adam FolwarcznyAdam FolwarcznyScore: 25,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2025 20:5918,458172,008,068142,337,0009,021,0002,449,408
2Jul 1, 2025 20:5921,662203,014,860163,656,00013,970,0002,478,080
3Jul 1, 2025 20:5922,367208,638,596171,382,00012,026,0002,355,200
4Jul 1, 2025 20:5922,853212,711,915176,370,00011,023,0002,289,664
5Jul 1, 2025 20:5925,026227,551,132187,193,00018,018,0002,473,984
6Jul 1, 2025 20:5925,839239,247,144197,889,00013,992,0002,400,256
7Jul 1, 2025 20:5926,250238,711,233195,231,00020,023,0002,457,600
8Jul 1, 2025 20:5926,284243,254,519204,502,00011,027,0002,387,968
9Jul 1, 2025 20:5927,500253,544,355207,538,00017,960,0002,314,240