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 15:01AnSaAnSaScore: 104,935Success
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 15:01103,08663,859,06336,135,0002,007,0002,277,376
2Jan 29, 2024 15:01103,11461,901,41035,140,0003,012,0002,523,136
3Jan 29, 2024 15:01103,24662,168,37736,191,0002,010,0002,523,136
4Jan 29, 2024 15:01103,60361,752,20634,298,0004,035,0002,277,376
5Jan 29, 2024 15:01103,75166,908,95336,368,0002,020,0002,269,184
6Jan 29, 2024 15:01103,97859,730,54236,448,0002,024,0002,523,136
7Jan 29, 2024 15:01104,93565,736,00037,831,000995,0002,277,376
8Jan 29, 2024 15:01104,95767,863,33436,843,0001,991,0002,375,680
9Jan 29, 2024 15:01105,03864,805,94337,868,000996,0002,269,184
10Jan 29, 2024 15:01105,532106,708,34939,047,02302,269,184
11Jan 29, 2024 15:01106,059105,440,96339,241,90002,252,800
12Jan 29, 2024 15:01107,061110,221,56839,612,56702,256,896