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 24, 2026 21:06boop34boop34Score: 7,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 21:077,795269,620,368251,335,0005,932,0002,113,536
2Jul 24, 2026 21:077,800270,149,684251,993,0005,411,0002,113,536
3Jul 24, 2026 21:077,858269,031,270251,761,0007,554,0002,113,536
4Jul 24, 2026 21:077,876269,772,859252,021,0007,918,0002,113,536
5Jul 24, 2026 21:077,891278,858,632252,701,0007,732,0002,117,632
6Jul 24, 2026 21:077,894270,402,237252,108,0008,422,0002,113,536
7Jul 24, 2026 21:077,896270,386,556251,854,0008,721,0002,113,536
8Jul 24, 2026 21:077,934281,330,675253,510,0008,323,0002,113,536
9Jul 24, 2026 21:077,972282,479,924255,323,0007,769,0002,113,536