TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listAug 2, 2022 19:06Yuriy LyfenkoYuriy LyfenkoScore: 61,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 19:0661,492546,956,99820,774,0001,978,0002,285,568
2Aug 2, 2022 19:0661,503551,991,22520,778,0001,978,0002,281,472
3Aug 2, 2022 19:0661,541552,381,18221,780,000990,0002,281,472
4Aug 2, 2022 19:0661,546551,496,52920,792,0001,980,0002,281,472
5Aug 2, 2022 19:0661,659547,870,88221,823,000991,0002,281,472
6Aug 2, 2022 19:0661,659545,768,65721,777,0001,037,0002,281,472
7Aug 2, 2022 19:0661,708544,539,23220,847,0001,985,0002,281,472
8Aug 2, 2022 19:0661,811546,366,79621,876,000994,0002,281,472
9Aug 2, 2022 19:0661,903549,212,32221,909,000995,0002,285,568
10Aug 2, 2022 19:0663,875584,095,76923,633,57502,248,704
11Aug 2, 2022 19:0664,015595,041,90423,685,58302,269,184
12Aug 2, 2022 19:0664,238583,846,52623,767,93402,265,088