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 listDec 3, 2024 07:42A L ManningA L ManningScore: 47,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2024 07:4245,6251,368,759,4121,327,176,00012,991,0002,760,704
2Dec 3, 2024 07:4246,4321,392,954,0001,356,644,0008,997,0002,580,480
3Dec 3, 2024 07:4246,6421,399,263,2321,360,152,00013,991,0002,580,480
4Dec 3, 2024 07:4246,9191,407,573,9981,370,929,0009,992,0002,580,480
5Dec 3, 2024 07:4247,2221,416,658,5701,379,739,0008,998,0002,768,896
6Dec 3, 2024 07:4247,3501,420,503,1111,375,371,00010,994,0002,580,480
7Dec 3, 2024 07:4247,4331,423,004,5671,378,175,00013,991,0002,580,480
8Dec 3, 2024 07:4248,7801,463,395,4741,420,892,00013,989,0002,764,800
9Dec 3, 2024 07:4248,9441,468,321,3111,427,325,00016,991,0002,580,480