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 8, 2021 19:30Yuriy LyfenkoYuriy LyfenkoScore: 221,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 19:30221,797143,603,40182,064,89202,199,552
2Jul 8, 2021 19:30221,858148,519,42982,087,31802,187,264
3Jul 8, 2021 19:30221,931143,638,86982,114,57602,179,072