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 7, 2021 20:37Yuriy LyfenkoYuriy LyfenkoScore: 1,601,217Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 20:371,237,174917,366,051457,754,525060,346,368
2Jul 7, 2021 20:371,238,001911,502,838458,060,484064,671,744
3Jul 7, 2021 20:371,243,446948,416,255460,075,199063,500,288
4Jul 7, 2021 20:371,601,217648,361,035592,450,27302,289,664
5Jul 7, 2021 20:372,124,638843,899,753786,116,22102,285,568
6Jul 7, 2021 20:372,134,642870,731,192789,817,62302,289,664