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 listMar 6, 2026 23:14Pavel SamyginPavel SamyginScore: 15,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 23:1414,951514,364,819476,404,00016,978,0002,420,736
2Mar 6, 2026 23:1415,051518,916,035475,724,00020,943,0002,289,664
3Mar 6, 2026 23:1415,159529,332,562479,290,00020,968,0002,326,528
4Mar 6, 2026 23:1415,335532,851,645483,064,00023,003,0002,318,336
5Mar 6, 2026 23:1415,511537,591,326488,867,00022,993,0002,293,760
6Mar 6, 2026 23:1415,516538,386,969496,056,00015,969,0002,277,376
7Mar 6, 2026 23:1415,547537,399,664489,041,00024,002,0002,293,760
8Mar 6, 2026 23:1415,576533,565,448486,997,00026,999,0002,433,024
9Mar 6, 2026 23:1415,584543,866,730493,312,00020,970,0002,531,328