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 20, 2026 20:43janwwwjanwwwScore: 10,164Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 20:4510,122343,285,010330,856,0003,175,0002,113,536
2Oct 20, 2026 20:4510,129343,398,275331,045,0003,220,0002,113,536
3Oct 20, 2026 20:4510,131343,574,060331,168,0003,156,0002,113,536
4Oct 20, 2026 20:4510,136343,728,474331,364,0003,152,0002,113,536
5Oct 20, 2026 20:4510,164344,626,104332,305,0003,111,0002,113,536
6Oct 20, 2026 20:4510,192345,655,474333,131,0003,211,0002,113,536
7Oct 20, 2026 20:4510,224346,618,124334,199,0003,214,0002,113,536
8Oct 20, 2026 20:4510,231346,898,113334,368,0003,256,0002,113,536
9Oct 20, 2026 20:4510,310349,437,518337,063,0003,185,0002,113,536