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 listMay 13, 2026 11:55Josu San MartinJosu San MartinScore: 3,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 11:563,512127,564,625114,911,0001,009,0002,113,536
2May 13, 2026 11:563,513124,701,193114,938,0001,010,0002,113,536
3May 13, 2026 11:563,516125,489,857115,023,0001,010,0002,113,536
4May 13, 2026 11:563,517124,767,735115,079,0001,012,0002,113,536
5May 13, 2026 11:563,519124,868,291115,118,0001,012,0002,113,536
6May 13, 2026 11:563,537127,431,029115,713,0001,013,0002,113,536
7May 13, 2026 11:563,541128,596,043115,859,0001,010,0002,113,536
8May 13, 2026 11:563,545127,922,788115,983,0001,009,0002,113,536
9May 13, 2026 11:563,553127,655,518116,265,0001,015,0002,113,536