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 12, 2026 22:16Josu San MartinJosu San MartinScore: 4,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 22:144,808185,649,904156,669,0001,995,0002,392,064
2Jan 12, 2026 22:144,808185,008,898157,668,000997,0002,289,664
3Jan 12, 2026 22:144,808183,777,309157,678,000997,0002,404,352
4Jan 12, 2026 22:164,959191,662,123161,661,0001,995,0002,289,664
5Jan 12, 2026 22:164,959193,525,486161,664,0001,995,0002,289,664
6Jan 12, 2026 22:164,968191,415,277162,937,000999,0002,289,664