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 8, 2025 19:23Adam FolwarcznyAdam FolwarcznyScore: 16,180Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2025 19:2314,161137,314,96598,103,00018,018,0002,445,312
2Jul 8, 2025 19:2315,158143,648,327114,269,00010,023,0002,379,776
3Jul 8, 2025 19:2315,351149,544,706112,895,00012,987,0002,322,432
4Jul 8, 2025 19:2315,746158,759,088113,103,00016,014,0002,301,952
5Jul 8, 2025 19:2316,180158,255,811122,703,0009,975,0002,330,624
6Jul 8, 2025 19:2316,801165,333,451121,798,00015,973,0002,416,640
7Jul 8, 2025 19:2318,567178,786,325135,223,00017,028,0002,445,312
8Jul 8, 2025 19:2319,383185,207,564140,946,00017,993,0002,314,240
9Jul 8, 2025 19:23136,0951,145,811,4341,000,082,000115,893,0002,281,472