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 listNov 26, 2022 14:42Kenneth MaplesKenneth MaplesScore: 20,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2022 14:4520,409737,896,542673,501,24102,224,128
2Nov 26, 2022 14:4520,420738,982,705673,875,59402,236,416
3Nov 26, 2022 14:4520,424729,872,985674,007,05702,232,320
4Nov 26, 2022 14:4220,433732,335,331674,299,34602,224,128
5Nov 26, 2022 14:4220,517758,020,031677,065,13402,224,128
6Nov 26, 2022 14:4220,694751,227,547682,888,96802,236,416