Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listJun 6, 2021 20:29Yuriy LyfenkoYuriy LyfenkoScore: 50,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2021 20:2950,0991,502,984,796994,448,34402,433,024
2Jun 6, 2021 20:2950,1901,505,703,957992,556,71602,416,640
3Jun 6, 2021 20:2950,1901,505,712,621989,029,11202,404,352
4Jun 6, 2021 20:2950,3051,509,145,687992,535,46902,560,000
5Jun 6, 2021 20:2950,4861,514,582,145988,132,52302,564,096
6Jun 6, 2021 20:2950,5061,515,170,995995,422,97002,297,856
7Jun 6, 2021 20:2950,5921,517,764,691994,033,16302,535,424
8Jun 6, 2021 20:2950,7221,521,654,531987,927,86702,297,856
9Jun 6, 2021 20:2950,9001,527,002,913999,155,51102,514,944