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 listJan 29, 2024 13:08AnSaAnSaScore: 107,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2024 13:08106,86560,513,87538,527,0001,013,0002,277,376
2Jan 29, 2024 13:08106,92264,401,25538,547,0001,014,0002,277,376
3Jan 29, 2024 13:08107,06265,807,66838,598,0001,015,0002,277,376
4Jan 29, 2024 13:08107,18665,434,07138,643,0001,016,0002,531,328
5Jan 29, 2024 13:08107,68467,210,91337,851,0001,992,0002,277,376
6Jan 29, 2024 13:08107,91663,474,90336,935,0002,994,0002,375,680
7Jan 29, 2024 13:08107,96865,174,48437,951,0001,997,0002,277,376
8Jan 29, 2024 13:08108,04166,005,89838,976,000999,0002,265,088
9Jan 29, 2024 13:08108,57062,985,35638,163,0002,008,0002,277,376
10Jan 29, 2024 13:08111,324123,463,00741,189,74002,203,648
11Jan 29, 2024 13:08111,518114,026,95541,261,80802,252,800
12Jan 29, 2024 13:08111,771100,657,24441,355,11302,277,376