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 listJan 13, 2026 21:55Josu San MartinJosu San MartinScore: 4,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 21:554,435170,822,515143,346,0003,007,0002,371,584
2Jan 15, 2026 01:104,442175,244,385144,606,0001,994,0002,539,520
3Jan 15, 2026 01:104,444173,248,706143,645,0002,992,0002,387,968
4Jan 15, 2026 01:104,445178,044,527143,695,0002,993,0002,539,520
5Jan 13, 2026 21:554,447174,400,554143,741,0002,994,0002,527,232
6Jan 13, 2026 21:554,450175,372,037144,865,0001,998,0002,379,776