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 7, 2021 20:47Yuriy LyfenkoYuriy LyfenkoScore: 49,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2021 20:4748,7871,463,599,9071,408,602,01602,539,520
2Jun 7, 2021 20:4748,8761,466,274,9071,402,556,06202,351,104
3Jun 7, 2021 20:4749,0301,470,910,4331,402,444,13002,338,816
4Jun 7, 2021 20:4749,0391,471,170,0231,413,608,76402,359,296
5Jun 7, 2021 20:4749,1461,474,375,4571,413,756,12802,379,776
6Jun 7, 2021 20:4749,3201,479,600,8651,414,837,49102,564,096