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 listOct 17, 2026 21:57e1011e1011Score: 49,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 21:5849,7831,654,441,7271,525,474,000117,369,0002,117,632
2Oct 17, 2026 21:5849,7931,654,425,9691,526,034,000117,163,0002,113,536
3Oct 17, 2026 21:5849,8291,655,553,6521,527,833,000116,526,0002,117,632
4Oct 17, 2026 21:5849,8441,656,468,3591,528,092,000116,762,0002,117,632
5Oct 17, 2026 21:5849,9181,658,833,6011,530,696,000116,615,0002,113,536
6Oct 17, 2026 21:5849,9191,658,799,2011,532,732,000114,608,0002,113,536
7Oct 17, 2026 21:5849,9351,661,004,5011,530,133,000117,745,0002,117,632
8Oct 17, 2026 21:5850,0321,662,533,0041,534,051,000117,005,0002,117,632
9Oct 17, 2026 21:5850,0781,663,557,0001,536,163,000116,420,0002,113,536