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 20:24Pavel SkripkinPavel SkripkinScore: 84,368Success
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 20:2483,1542,774,210,2612,739,070,0004,998,0002,355,200
2Jan 19, 2026 20:2484,3682,810,445,4122,779,160,0004,998,0002,277,376
3Jan 19, 2026 20:2484,7592,826,180,8272,790,038,0006,995,0002,281,472