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 22:33anboto1anboto1Score: 11,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 22:3611,281381,628,848359,624,00012,655,0002,117,632
2Jun 7, 2026 22:3611,342383,600,528361,610,00012,697,0002,117,632
3Jun 7, 2026 22:3611,358384,102,690362,871,00011,944,0002,117,632
4Jun 7, 2026 22:3611,370384,554,474362,566,00012,644,0002,117,632
5Jun 7, 2026 22:3611,405385,642,543363,800,00012,584,0002,117,632
6Jun 7, 2026 22:3611,476388,055,125366,689,00012,049,0002,117,632
7Jun 7, 2026 22:3611,496388,751,500366,554,00012,842,0002,117,632
8Jun 7, 2026 22:3611,513389,338,460367,134,00012,825,0002,117,632
9Jun 7, 2026 22:3611,568391,098,930369,580,00012,165,0002,117,632