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 14:06AnSaAnSaScore: 139,650Success
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 14:06139,223114,999,19751,512,36402,260,992
2Jan 29, 2024 14:06139,650114,482,21651,670,67202,260,992
3Jan 29, 2024 14:06139,652114,456,35151,671,13902,269,184