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 listJan 19, 2026 21:10Pavel SkripkinPavel SkripkinScore: 31,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2026 21:1031,7051,068,338,2681,042,274,0003,997,0002,338,816
2Jan 19, 2026 21:1031,7961,071,282,6961,045,266,0003,997,0002,281,472
3Jan 19, 2026 21:1031,8891,076,151,8311,048,349,0003,997,0002,543,616
4Jan 19, 2026 21:1031,9831,081,988,6061,051,431,0003,997,0002,281,472
5Jan 19, 2026 21:1031,9901,083,977,6331,051,677,0003,998,0002,543,616
6Jan 19, 2026 21:1032,3351,095,393,0351,062,058,0004,995,0002,355,200
7Jan 19, 2026 21:1034,1671,150,029,3751,124,505,0002,998,0002,342,912
8Jan 19, 2026 21:1034,2051,151,742,1061,124,780,0003,995,0002,285,568
9Jan 19, 2026 21:1034,5721,163,922,6571,136,879,0003,996,0002,445,312