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 7, 2026 23:59anboto1anboto1Score: 11,185Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 00:0111,048375,728,947352,645,00011,951,0002,117,632
2Jun 8, 2026 00:0111,060374,353,089352,385,00012,620,0002,117,632
3Jun 8, 2026 00:0111,075374,769,414352,814,00012,679,0002,117,632
4Jun 8, 2026 00:0111,096375,544,038354,223,00011,967,0002,117,632
5Jun 8, 2026 00:0111,185378,317,336356,499,00012,616,0002,117,632
6Jun 8, 2026 00:0111,191378,510,492357,255,00012,059,0002,117,632
7Jun 8, 2026 00:0111,256380,763,002358,736,00012,742,0002,117,632
8Jun 8, 2026 00:0111,286381,620,761360,209,00012,230,0002,117,632
9Jun 8, 2026 00:0111,286381,690,242360,190,00012,280,0002,117,632