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 8, 2026 02:07anboto1anboto1Score: 9,773Success
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 02:089,596325,981,882304,094,00012,578,0002,117,632
2Jun 8, 2026 02:089,690329,671,253307,699,00012,084,0002,117,632
3Jun 8, 2026 02:089,727330,327,212308,664,00012,327,0002,117,632
4Jun 8, 2026 02:089,772331,764,169309,879,00012,610,0002,117,632
5Jun 8, 2026 02:089,773331,904,964309,831,00012,690,0002,117,632
6Jun 8, 2026 02:089,826333,582,310311,497,00012,777,0002,117,632
7Jun 8, 2026 02:089,875335,133,809313,061,00012,840,0002,117,632
8Jun 8, 2026 02:089,908336,237,586314,317,00012,655,0002,117,632
9Jun 8, 2026 02:089,920336,551,020314,536,00012,825,0002,117,632