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:13e1011e1011Score: 66,753Success
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:1565,9452,187,916,0022,167,663,0008,545,0002,113,536
2Oct 17, 2026 21:1566,3302,200,008,8762,180,092,0008,817,0002,113,536
3Oct 17, 2026 21:1566,3812,202,197,2832,182,054,0008,536,0002,113,536
4Oct 17, 2026 21:1566,4962,205,412,7362,185,862,0008,522,0002,113,536
5Oct 17, 2026 21:1566,7532,215,455,3492,194,356,0008,524,0002,117,632
6Oct 17, 2026 21:1566,7652,214,249,5952,194,643,0008,617,0002,113,536
7Oct 17, 2026 21:1568,8572,283,784,9982,263,697,0008,612,0002,113,536
8Oct 17, 2026 21:1569,1722,294,213,0262,274,329,0008,364,0002,113,536
9Oct 17, 2026 21:1569,4232,302,405,1612,282,536,0008,427,0002,113,536