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 listJul 25, 2026 17:39boop34boop34Score: 6,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2026 17:406,757234,338,062219,989,0003,000,0002,113,536
2Jul 25, 2026 17:406,773234,641,133220,597,0002,942,0002,113,536
3Jul 25, 2026 17:406,775233,473,790219,515,0004,085,0002,113,536
4Jul 25, 2026 17:406,792234,715,530220,050,0004,090,0002,113,536
5Jul 25, 2026 17:406,792234,131,784219,710,0004,445,0002,113,536
6Jul 25, 2026 17:406,797234,162,880220,217,0004,095,0002,113,536
7Jul 25, 2026 17:406,799234,316,455219,985,0004,401,0002,113,536
8Jul 25, 2026 17:406,803234,363,966220,236,0004,281,0002,113,536
9Jul 25, 2026 17:406,806234,935,278220,131,0004,496,0002,113,536