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 listDec 4, 2024 14:17NoSIMD_C#NoSIMD_C#Score: 196,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2024 14:17189,8686,297,832,6956,180,716,00084,941,0002,396,160
2Dec 4, 2024 14:17190,9536,334,656,7476,209,525,00091,918,0002,539,520
3Dec 4, 2024 14:17195,9546,494,066,4086,393,528,00072,948,0002,412,544
4Dec 4, 2024 14:17196,4846,513,935,7346,401,021,00082,935,0002,367,488
5Dec 4, 2024 14:17196,9166,529,132,8016,430,265,00067,949,0002,465,792
6Dec 4, 2024 14:17197,0066,535,263,5076,404,259,00096,928,0002,351,104
7Dec 4, 2024 14:17197,8476,558,588,4376,437,011,00091,928,0002,424,832
8Dec 4, 2024 14:17198,1076,569,362,6416,456,582,00080,944,0002,355,200
9Dec 4, 2024 14:17198,2136,570,209,5706,459,072,00081,950,0002,293,760