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 8, 2026 20:24Josu San MartinJosu San MartinScore: 9,371Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 20:339,222330,240,417301,313,0003,003,0002,375,680
2Jan 8, 2026 20:249,252334,780,488301,325,0004,004,0002,273,280
3Jan 8, 2026 20:339,310331,846,594303,229,0004,003,0002,277,376
4Jan 8, 2026 20:339,371338,145,802305,252,0004,003,0002,437,120
5Jan 8, 2026 20:249,442338,885,789306,577,0004,993,0002,314,240
6Jan 8, 2026 20:249,841354,464,555321,772,0002,997,0002,379,776