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 22, 2025 23:33Oleg KovalovOleg KovalovScore: 853,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 23:33851,089342,328,151129,960,000184,943,0002,408,448
2Jan 22, 2025 23:33853,222340,047,026122,880,000192,812,0002,310,144
3Jan 22, 2025 23:33854,743346,081,570130,105,000186,150,0002,301,952