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 listDec 12, 2024 18:36zielajzielajScore: 5,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2024 22:052,90949,520,13122,863,000994,0002,355,200
2Dec 12, 2024 18:362,91246,805,40323,876,00002,506,752
3Oct 20, 2024 22:052,91950,316,62921,938,0001,994,0002,478,080
4Dec 12, 2024 18:365,49968,345,87543,089,0002,004,0002,281,472
5Dec 12, 2024 18:365,52868,522,17945,328,00002,334,720
6Oct 20, 2024 22:055,56372,651,02643,588,0002,027,0002,269,184