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 13:48Emanuele BolognesiEmanuele BolognesiScore: 47,559Success
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 13:4846,598408,434,018265,070,000117,030,0002,396,160
2Apr 24, 2025 13:4847,030407,207,269262,757,000122,886,0002,400,256
3Apr 24, 2025 13:4847,374416,243,424260,641,000127,823,0002,428,928
4Apr 24, 2025 13:4847,539411,132,214282,871,000106,951,0002,392,064
5Apr 24, 2025 13:4847,559424,017,471281,986,000107,994,0002,396,160
6Apr 24, 2025 13:4847,775421,049,859269,830,000121,923,0002,523,136
7Apr 24, 2025 13:4847,820418,892,301266,083,000126,039,0002,392,064
8Apr 24, 2025 13:4848,030418,412,448257,898,000135,946,0002,392,064
9Apr 24, 2025 13:4848,455427,529,233274,537,000122,792,0002,482,176