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 15, 2026 22:12Dominique GarmierDominique GarmierScore: 31,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 21:3331,3001,060,153,2691,022,891,0009,998,0002,498,560
2Mar 15, 2026 22:1231,3881,064,689,7411,025,821,0009,998,0002,478,080
3Mar 15, 2026 21:3331,4871,063,310,0751,029,077,00010,000,0002,519,040
4Mar 15, 2026 22:1231,6171,070,504,0991,033,382,0009,994,0002,285,568
5Mar 15, 2026 21:3331,9241,086,370,1811,044,512,0008,995,0002,449,408
6Mar 15, 2026 22:1232,0711,083,624,0321,048,348,0009,993,0002,502,656