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 17, 2026 15:12Alexander KrivolapovAlexander KrivolapovScore: 32,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 9, 2026 13:5931,8201,078,691,284900,198,000149,866,0002,379,776
2Mar 9, 2026 13:5932,1231,096,090,651918,173,000141,872,0002,424,832
3Mar 17, 2026 15:1232,5061,096,392,185932,872,000139,830,0002,306,048
4Mar 17, 2026 15:1232,5601,107,557,618938,671,000135,807,0002,441,216
5Mar 9, 2026 13:5932,5971,103,928,963928,875,000146,822,0002,285,568
6Mar 17, 2026 15:1232,6351,106,493,236910,275,000166,684,0002,347,008