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 listAug 11, 2024 11:21korsajankorsajanScore: 151,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2024 12:03150,4025,034,809,9194,963,276,46402,301,952
2Aug 11, 2024 11:21150,6315,038,128,0384,970,835,14502,277,376
3Aug 11, 2024 12:03150,6375,028,455,2084,971,008,01602,260,992
4Aug 11, 2024 12:03151,1125,049,987,4814,986,706,42002,265,088
5Aug 11, 2024 11:21152,2495,089,928,4845,024,217,86902,277,376
6Aug 11, 2024 11:21153,2575,119,205,4305,057,473,49702,281,472