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 08:04A L ManningA L ManningScore: 21,880Success
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 08:0421,685650,540,1231,780,888,00030,980,0002,850,816
2Dec 3, 2024 08:0421,719651,559,2291,780,898,00027,982,0002,838,528
3Dec 3, 2024 08:0421,871656,123,5921,807,831,00026,997,0002,580,480
4Dec 3, 2024 08:0421,878656,352,8241,812,190,00022,002,0002,715,648
5Dec 3, 2024 08:0421,880656,410,7371,793,131,00020,001,0002,846,720
6Dec 3, 2024 08:0422,180665,413,6391,788,735,00023,996,0002,846,720
7Dec 3, 2024 08:0423,640709,201,0131,962,560,00025,967,0002,715,648
8Dec 3, 2024 08:0423,687710,610,7421,964,052,00032,967,0002,768,896
9Dec 3, 2024 08:0428,071842,124,8631,955,118,00026,987,0002,932,736