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 12:36Yuriy LyfenkoYuriy LyfenkoScore: 61,522Success
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 12:3661,000546,971,19921,545,0001,025,0002,289,664
2Aug 2, 2022 12:3661,051554,128,13821,563,0001,026,0002,285,568
3Aug 2, 2022 12:3661,057553,493,51421,565,0001,026,0002,289,664
4Aug 2, 2022 12:3661,070552,078,11422,596,00002,281,472
5Aug 2, 2022 12:3661,157547,230,96921,600,0001,028,0002,281,472
6Aug 2, 2022 12:3661,503547,785,10520,778,0001,978,0002,273,280
7Aug 2, 2022 12:3661,522550,504,78721,774,000989,0002,289,664
8Aug 2, 2022 12:3661,527551,564,85021,776,000989,0002,281,472
9Aug 2, 2022 12:3661,543556,121,97520,791,0001,980,0002,281,472
10Aug 2, 2022 12:3664,435586,063,57123,840,79702,265,088
11Aug 2, 2022 12:3664,439585,044,29623,842,54402,277,376
12Aug 2, 2022 12:3664,549594,004,11023,883,03402,248,704