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 listSep 4, 2024 14:15matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2024 14:1500000Error: expected "1021102 ", got "1021101 "stderr
2Sep 4, 2024 14:1600000Error: expected "1020823 ", got "1020822 "stderr
3Sep 8, 2024 13:4500000Error: expected "1021622 ", got "1021621 "stderr
4Sep 8, 2024 13:4600000Error: expected "1025990 ", got "1025989 "stderr
5Sep 8, 2024 13:4800000Error: expected "1022400 ", got "1022399 "stderr
6Sep 8, 2024 13:4900000Error: expected "1026450 ", got "1026449 "stderr
7Sep 8, 2024 13:5100000Error: expected "1026775 ", got "1026774 "stderr
8Sep 4, 2024 14:185,602212,849,259182,867,0001,998,0002,408,448
9Sep 4, 2024 14:185,656209,593,668183,644,0002,994,0002,412,544
10Sep 4, 2024 14:185,706215,104,002186,299,0002,003,0002,498,560