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 20, 2024 15:18NoSIMD_C#NoSIMD_C#Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2024 15:1300000Error: expected "1018520 ", got "1018521 "
2Nov 20, 2024 15:1600000Error: expected "1023745 ", got "1023746 "
3Nov 20, 2024 15:18354,69511,737,243,19411,580,021,000124,903,0002,482,176
4Nov 20, 2024 15:18356,09211,786,905,74711,583,171,000167,872,0002,400,256
5Nov 20, 2024 15:18357,54111,833,882,48311,671,948,000126,901,0002,273,280