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:32Adam FolwarcznyAdam FolwarcznyScore: 9,190Success
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:328,57891,312,07964,314,0006,029,0002,322,432
2Jul 8, 2025 19:328,70492,866,64367,354,0004,021,0002,449,408
3Jul 8, 2025 19:328,76295,296,46768,857,0002,993,0002,392,064
4Jul 8, 2025 19:329,14796,646,50471,008,0004,000,0002,301,952
5Jul 8, 2025 19:329,19098,127,16972,344,0003,014,0002,494,464
6Jul 8, 2025 19:329,535100,773,24771,169,0007,016,0002,404,352
7Jul 8, 2025 19:329,633105,255,34671,992,0006,999,0002,469,888
8Jul 8, 2025 19:32109,798924,995,700786,425,000113,916,0002,297,856
9Jul 8, 2025 19:32133,3351,122,994,938980,417,000112,932,0002,478,080