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 listJul 1, 2021 19:31Igor ShekalevIgor ShekalevScore: 92,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2021 19:2792,2413,108,261,7733,043,937,43602,289,664
2Jul 1, 2021 19:2792,2893,101,932,1033,045,534,31102,301,952
3Jul 1, 2021 19:3192,3563,104,133,4663,047,764,32702,244,608
4Jul 1, 2021 19:3192,6953,125,731,6083,058,930,05002,211,840
5Jul 1, 2021 19:2792,8843,122,818,3013,065,163,15802,248,704
6Jul 1, 2021 19:3193,4003,140,535,3773,082,208,64502,244,608