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 21:19Josu San MartinJosu San MartinScore: 3,321Success
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 21:203,317119,937,332108,430,0001,047,0002,113,536
2May 13, 2026 21:203,318121,359,154108,455,0001,057,0002,113,536
3May 13, 2026 21:203,318118,364,042108,450,0001,046,0002,113,536
4May 13, 2026 21:203,320120,074,723108,516,0001,049,0002,113,536
5May 13, 2026 21:203,321122,019,185108,563,0001,045,0002,113,536
6May 13, 2026 21:203,322119,235,963108,612,0001,042,0002,113,536
7May 13, 2026 21:203,328119,237,280108,790,0001,056,0002,113,536
8May 13, 2026 21:203,332119,433,592108,910,0001,056,0002,113,536
9May 13, 2026 21:203,369121,647,922110,141,0001,057,0002,113,536