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 listApr 24, 2025 14:22Emanuele BolognesiEmanuele BolognesiScore: 41,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2025 14:2240,889361,794,828226,521,000108,770,0002,396,160
2Apr 24, 2025 14:2241,144364,156,734225,585,000111,794,0002,396,160
3Apr 24, 2025 14:2241,349362,141,945229,042,000110,020,0002,400,256
4Apr 24, 2025 14:2241,498371,940,868219,537,000120,745,0002,396,160
5Apr 24, 2025 14:2241,689368,427,693232,900,000108,953,0002,396,160
6Apr 24, 2025 14:2241,931364,770,098232,888,000110,946,0002,519,040
7Apr 24, 2025 14:2241,993374,422,714224,570,000119,770,0002,277,376
8Apr 24, 2025 14:2242,010369,182,455223,664,000120,818,0002,473,984
9Apr 24, 2025 14:2242,187368,314,673222,958,000122,976,0002,400,256