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 listJul 14, 2021 14:58Yuriy LyfenkoYuriy LyfenkoScore: 61,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 14:5861,603554,452,55820,811,0001,982,0002,281,472
2Jul 14, 2021 14:5861,614545,929,09921,806,000991,0002,285,568
3Jul 14, 2021 14:5861,711544,688,55920,848,0001,985,0002,281,472
4Jul 14, 2021 14:5861,716552,811,06520,850,0001,985,0002,281,472
5Jul 14, 2021 14:5861,743546,032,76420,859,0001,986,0002,285,568
6Jul 14, 2021 14:5861,778550,390,34420,871,0001,987,0002,285,568
7Jul 14, 2021 14:5861,808546,091,39620,881,0001,988,0002,285,568
8Jul 14, 2021 14:5861,824550,089,23220,886,0001,989,0002,281,472
9Jul 14, 2021 14:5861,878545,216,17820,905,0001,990,0002,281,472
10Jul 14, 2021 14:5864,420589,534,18623,835,48002,244,608
11Jul 14, 2021 14:5864,701581,075,27423,939,19202,244,608
12Jul 14, 2021 14:5864,854576,081,97423,996,03302,244,608