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 15, 2026 03:23Josu San MartinJosu San MartinScore: 5,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 03:335,785214,006,437186,893,0003,997,0002,379,776
2Jan 15, 2026 03:335,806222,256,915186,622,0004,989,0002,277,376
3Jan 15, 2026 03:235,822218,781,126189,126,0003,002,0002,277,376
4Jan 15, 2026 03:335,827217,560,379190,283,0002,002,0002,277,376
5Jan 15, 2026 03:235,838223,925,477188,649,0003,992,0002,383,872
6Jan 15, 2026 03:235,894226,933,333192,500,0001,994,0002,371,584