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 21, 2026 18:15M-RochatM-RochatScore: 18,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:1618,274614,434,825598,961,0004,083,0002,113,536
2May 21, 2026 18:1618,297616,178,835599,783,0004,020,0002,113,536
3May 21, 2026 18:1618,323617,167,778601,661,0003,006,0002,113,536
4May 21, 2026 18:1618,399616,752,022603,171,0004,022,0002,113,536
5May 21, 2026 18:1618,411620,506,387604,564,0003,011,0002,113,536
6May 21, 2026 18:1618,543622,933,907607,920,0004,025,0002,113,536
7May 21, 2026 18:1618,836632,820,670618,596,0003,012,0002,113,536
8May 21, 2026 18:1619,455651,751,114637,920,0004,119,0002,113,536
9May 21, 2026 18:1619,742663,286,059647,388,0004,104,0002,113,536