Unique strings Sergey Svistunov

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 listJan 22, 2025 20:47Gerard SmitGerard SmitScore: 147,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 20:47145,9734,845,041,1834,802,104,00014,990,0002,543,616
2Jan 22, 2025 20:47146,5394,867,450,2184,819,806,00015,989,0002,543,616
3Jan 22, 2025 20:47147,0394,881,362,3234,838,289,00013,992,0002,297,856
4Jan 22, 2025 20:47147,1704,896,305,0804,850,599,0005,995,0002,527,232
5Jan 22, 2025 20:47147,6764,904,439,6854,858,316,00014,991,0002,387,968
6Jan 22, 2025 20:47148,7514,936,553,6084,890,800,00017,988,0002,338,816
7Jan 22, 2025 20:47151,9805,041,633,2285,004,343,00010,994,0002,473,984
8Jan 22, 2025 20:47157,1275,213,437,2665,168,212,00016,990,0002,420,736
9Jan 22, 2025 20:47159,3935,294,063,4615,247,970,00011,993,0002,441,216