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 listOct 13, 2024 00:05zielajzielajScore: 532,252Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 00:05500,0354,132,894,1054,039,346,00060,944,0002,371,584
2Oct 13, 2024 00:05512,3474,230,696,7234,131,290,00069,954,0002,281,472
3Oct 13, 2024 00:05516,2434,263,020,4374,157,242,00075,949,0002,281,472
4Oct 13, 2024 00:05524,0454,321,780,2434,219,238,00077,930,0002,441,216
5Oct 13, 2024 00:05532,2524,393,764,1454,290,524,00073,940,0002,424,832
6Oct 13, 2024 00:05535,4034,416,787,6444,318,364,00071,939,0002,281,472
7Oct 13, 2024 00:05538,0024,438,818,4484,355,658,00055,957,0002,281,472
8Oct 13, 2024 00:05542,1914,476,350,0734,372,018,00073,949,0002,457,600
9Oct 13, 2024 00:05551,7384,553,155,1684,440,320,00083,930,0002,404,352