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 listMar 25, 2026 20:02Dominique GarmierDominique GarmierScore: 46,085Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 20:0245,9331,542,198,7071,510,783,0004,999,0002,371,584
2Mar 25, 2026 20:0246,0851,549,735,8671,514,801,0005,995,0002,277,376
3Mar 25, 2026 20:0249,2161,646,878,7051,619,118,0004,997,0002,277,376