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 6, 2025 18:02Adam FolwarcznyAdam FolwarcznyScore: 18,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 18:0215,092150,683,191106,790,00016,966,0002,408,448
2Jul 6, 2025 18:0217,046162,476,729122,807,00016,973,0002,396,160
3Jul 6, 2025 18:0218,512175,995,826139,815,00011,984,0002,449,408
4Jul 6, 2025 18:0218,625179,110,141138,748,00013,974,0002,351,104
5Jul 6, 2025 18:0218,807183,244,506136,190,00018,025,0002,269,184
6Jul 6, 2025 18:0219,432180,592,151142,309,00017,037,0002,277,376
7Jul 6, 2025 18:0220,618191,066,399154,065,00015,006,0002,359,296
8Jul 6, 2025 18:0221,183198,466,719158,725,00014,974,0002,523,136
9Jul 6, 2025 18:0223,502222,459,475175,740,00016,974,0002,437,120