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 10, 2022 19:38eldon-chungeldon-chungScore: 34,001Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2022 19:3933,7981,173,759,5101,115,320,81002,281,472
2Sep 10, 2022 19:3833,8441,179,012,3581,116,840,69202,281,472
3Sep 10, 2022 19:3933,9391,191,803,7471,119,996,49902,277,376
4Sep 10, 2022 19:3934,0011,181,010,1031,122,024,06002,289,664
5Sep 10, 2022 19:3834,0511,183,650,0271,123,681,62902,285,568
6Sep 10, 2022 19:3836,0971,270,619,7951,191,187,52802,285,568