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:48GraceGraceScore: 536,325Success
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:48534,19017,686,594,42917,628,272,04402,306,048
2Jun 7, 2024 18:48534,75117,715,334,34117,646,767,99302,248,704
3Jun 7, 2024 18:48536,13517,745,686,80417,692,445,56302,277,376
4Jun 7, 2024 18:48536,32517,759,087,72317,698,723,73902,273,280
5Jun 7, 2024 18:48536,83517,774,126,86917,715,565,27102,224,128
6Jun 7, 2024 18:48536,94317,773,049,90017,719,124,45502,265,088