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 01:22Sergey SerebryakovSergey SerebryakovScore: 8,112Success
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 01:228,078287,926,446240,609,00025,957,0002,445,312
2Mar 6, 2026 01:228,099296,072,028242,238,00025,024,0002,473,984
3Mar 6, 2026 01:228,102290,809,423241,423,00025,938,0002,396,160
4Mar 6, 2026 01:228,108292,361,238239,598,00027,953,0002,523,136
5Mar 6, 2026 01:228,112293,188,353241,718,00025,969,0002,367,488
6Mar 6, 2026 01:228,116293,590,195242,856,00024,985,0002,379,776
7Mar 6, 2026 01:228,138293,259,883242,595,00025,956,0002,273,280
8Mar 6, 2026 01:228,147296,611,970243,853,00024,984,0002,445,312
9Mar 6, 2026 01:228,164299,091,428243,461,00025,942,0002,281,472