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 14, 2026 03:45Josu San MartinJosu San MartinScore: 3,341Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 03:463,329118,577,794108,846,0001,042,0002,113,536
2May 14, 2026 03:463,334120,712,187109,002,0001,042,0002,113,536
3May 14, 2026 03:463,336121,855,485109,055,0001,044,0002,113,536
4May 14, 2026 03:463,338120,669,319109,109,0001,056,0002,113,536
5May 14, 2026 03:463,341121,891,222109,199,0001,060,0002,113,536
6May 14, 2026 03:463,344119,535,530109,335,0001,035,0002,113,536
7May 14, 2026 03:463,346120,998,930109,393,0001,041,0002,113,536
8May 14, 2026 03:463,355121,461,179109,689,0001,056,0002,113,536
9May 14, 2026 03:463,363121,044,018109,946,0001,063,0002,113,536