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 listJan 10, 2026 01:24Josu San MartinJosu San MartinScore: 5,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 01:245,708215,112,437185,374,0003,006,0002,506,752
2Jan 10, 2026 01:245,719212,916,595186,731,0001,997,0002,392,064
3Jan 10, 2026 01:245,723213,722,004185,867,0002,997,0002,510,848
4Jan 10, 2026 01:245,726213,316,548183,965,0004,999,0002,375,680
5Jan 10, 2026 01:245,734211,836,348185,207,0004,004,0002,383,872
6Jan 10, 2026 01:245,746223,128,924183,626,0005,987,0002,277,376
7Jan 10, 2026 01:245,778215,855,426187,691,0002,995,0002,498,560
8Jan 10, 2026 01:245,804216,295,921187,541,0003,990,0002,379,776
9Jan 10, 2026 01:245,838213,194,301188,664,0003,992,0002,375,680