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 listJun 22, 2025 06:11Ian MckibbenIan MckibbenScore: 16,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 06:1116,682573,720,360469,586,00080,928,0002,351,104
2Jun 22, 2025 06:1116,704574,125,191471,348,00079,889,0002,510,848
3Jun 22, 2025 06:1116,712572,786,496466,581,00084,923,0002,400,256
4Jun 22, 2025 06:1116,742573,701,398460,566,00091,913,0002,293,760
5Jun 22, 2025 06:1116,828576,632,609460,444,00094,885,0002,539,520
6Jun 22, 2025 06:1116,829577,437,251463,472,00091,895,0002,519,040
7Jun 22, 2025 06:1116,845580,792,159469,914,00085,984,0002,347,008
8Jun 22, 2025 06:1116,951584,285,426468,495,00090,902,0002,281,472
9Jun 22, 2025 06:1116,989583,640,094470,692,00089,941,0002,539,520