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 15, 2023 00:34Paul MasurelPaul MasurelScore: 9,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2023 00:346,432109,562,09052,739,07402,281,472
2Jul 15, 2023 00:346,654124,459,81254,561,44202,314,240
3Jul 15, 2023 00:346,70284,999,78244,965,0009,992,0002,445,312
4Jul 15, 2023 00:346,751117,368,94955,355,01602,199,552
5Jul 15, 2023 00:348,93994,299,68741,168,00032,131,0002,469,888
6Jul 15, 2023 00:349,280106,259,58343,055,00033,042,0002,490,368
7Jul 15, 2023 00:349,300100,126,43840,139,00036,125,0002,478,080
8Jul 15, 2023 00:3420,297192,733,834159,421,0007,018,0002,400,256
9Jul 15, 2023 00:3420,446196,975,807164,665,0002,993,0002,490,368
10Jul 15, 2023 00:3420,832199,245,659160,830,0009,989,0002,387,968
11Jul 15, 2023 00:3421,048194,068,419165,572,0007,024,0002,326,528
12Jul 15, 2023 00:3421,117204,891,420164,154,0009,008,0002,465,792