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 listJun 7, 2024 18:54GraceGraceScore: 536,006Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 18:54533,33817,658,707,19117,600,161,94802,240,512
2Jun 7, 2024 18:54534,99117,721,761,74117,654,717,92702,314,240
3Jun 7, 2024 18:54535,15317,719,578,58917,660,041,72102,207,744
4Jun 7, 2024 18:54536,00617,751,027,69017,688,213,26602,248,704
5Jun 7, 2024 18:54537,25917,800,744,98317,729,534,87702,306,048
6Jun 7, 2024 18:54539,26717,852,836,74917,795,798,97302,310,144