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 13, 2026 20:04Josu San MartinJosu San MartinScore: 3,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 20:053,365119,796,035110,031,0001,026,0002,113,536
2May 13, 2026 20:053,366121,307,176110,058,0001,046,0002,113,536
3May 13, 2026 20:053,369119,977,987110,167,0001,037,0002,113,536
4May 13, 2026 20:053,370120,073,774110,181,0001,044,0002,113,536
5May 13, 2026 20:053,374121,085,302110,329,0001,045,0002,113,536
6May 13, 2026 20:053,374122,419,415110,301,0001,047,0002,113,536
7May 13, 2026 20:053,398123,797,288111,108,0001,045,0002,113,536
8May 13, 2026 20:053,399120,891,257111,133,0001,038,0002,113,536
9May 13, 2026 20:053,415121,851,882111,659,0001,057,0002,113,536