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 listAug 15, 2026 17:26Tomislav TunkovicTomislav TunkovicScore: 3,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 17:272,986106,938,66597,431,0001,114,00024,576
2Aug 15, 2026 17:272,991107,194,76797,574,0001,135,00024,576
3Aug 15, 2026 17:273,004107,579,43298,158,0001,002,00024,576
4Aug 15, 2026 17:273,013107,890,73998,442,0001,011,00024,576
5Aug 15, 2026 17:273,013108,025,24598,452,0001,005,00024,576
6Aug 15, 2026 17:273,033108,618,69999,113,0001,007,00024,576
7Aug 15, 2026 17:273,040108,732,48599,344,0001,002,00024,576
8Aug 15, 2026 17:273,045108,957,13199,504,0001,005,00024,576
9Aug 15, 2026 17:273,051109,121,52599,706,0001,005,00024,576