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, 2026 21:58anboto1anboto1Score: 11,664Success
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, 2026 21:5911,468387,941,145366,734,00011,719,0002,117,632
2Jun 7, 2026 21:5911,515389,829,777368,274,00011,731,0002,117,632
3Jun 7, 2026 21:5911,569391,222,947369,904,00011,874,0002,117,632
4Jun 7, 2026 21:5911,576391,696,470370,156,00011,864,0002,117,632
5Jun 7, 2026 21:5911,664394,190,542372,448,00012,485,0002,117,632
6Jun 7, 2026 21:5911,681394,739,379372,981,00012,495,0002,117,632
7Jun 7, 2026 21:5911,732396,739,980374,557,00012,627,0002,117,632
8Jun 7, 2026 21:5911,754397,585,345375,430,00012,483,0002,117,632
9Jun 7, 2026 21:5911,801398,793,269376,965,00012,497,0002,117,632