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 listMay 11, 2026 17:08Victor MerckléVictor MerckléScore: 8,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 17:098,118275,838,880228,045,00039,875,0002,113,536
2May 11, 2026 17:098,179279,518,521229,071,00040,849,0002,113,536
3May 11, 2026 17:098,227280,733,768230,445,00041,059,0002,113,536
4May 11, 2026 17:098,228278,954,426232,043,00039,482,0002,113,536
5May 11, 2026 17:098,244282,383,116232,876,00039,200,0002,113,536
6May 11, 2026 17:098,250281,407,297231,479,00040,784,0002,113,536
7May 11, 2026 17:098,282282,090,747233,028,00040,278,0002,113,536
8May 11, 2026 17:098,312283,646,726234,326,00039,978,0002,113,536
9May 11, 2026 17:098,341282,911,807234,325,00040,949,0002,113,536