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 15:14Igor ShekalevIgor ShekalevScore: 139,488Success
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 16:08138,3594,629,696,4354,565,857,34502,211,840
2Jul 1, 2021 16:08138,5484,631,189,8044,572,077,15402,215,936
3Jul 1, 2021 16:08138,7374,641,451,0284,578,305,17502,224,128
4Jul 1, 2021 15:14139,4884,668,953,6764,603,117,92002,232,320
5Jul 1, 2021 15:14140,0064,680,118,5024,620,206,97502,285,568
6Jul 1, 2021 15:14140,2214,687,354,7504,627,281,67302,297,856