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 24, 2026 08:33Victor MerckléVictor MerckléScore: 4,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 08:344,823166,711,278122,381,00036,802,0002,113,536
2Jun 24, 2026 08:344,835167,165,075122,960,00036,607,0002,113,536
3Jun 24, 2026 08:344,844167,644,278123,125,00036,729,0002,113,536
4Jun 24, 2026 08:344,848169,474,698123,081,00036,915,0002,113,536
5Jun 24, 2026 08:344,854167,815,925122,517,00037,671,0002,113,536
6Jun 24, 2026 08:344,859167,787,523122,376,00038,000,0002,113,536
7Jun 24, 2026 08:344,859167,899,744123,638,00036,717,0002,113,536
8Jun 24, 2026 08:344,871168,293,786123,120,00037,635,0002,113,536
9Jun 24, 2026 08:344,877169,086,998124,026,00036,924,0002,113,536