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 listAug 14, 2026 17:29marko1597marko1597Score: 596,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:30595,0654,889,484,0364,875,297,0004,239,0002,117,632stderr
2Aug 14, 2026 17:30595,1014,890,002,2754,875,356,0004,475,0002,117,632stderr
3Aug 14, 2026 17:30595,3524,892,012,0974,877,497,0004,393,0002,117,632stderr
4Aug 14, 2026 17:30595,9264,896,663,2464,882,219,0004,377,0002,117,632stderr
5Aug 14, 2026 17:30596,7364,903,214,1684,888,954,0004,283,0002,117,632stderr
6Aug 14, 2026 17:30597,6604,911,051,6324,896,373,0004,444,0002,117,632stderr
7Aug 14, 2026 17:30598,9114,921,025,5074,906,721,0004,352,0002,117,632stderr
8Aug 14, 2026 17:30600,8954,937,327,3554,923,039,0004,303,0002,117,632stderr
9Aug 14, 2026 17:30601,0614,938,664,9224,924,650,0004,055,0002,117,632stderr