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 listMay 16, 2026 08:33M-RochatM-RochatScore: 28,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:3428,571951,816,817930,018,00012,843,0002,113,536
2May 16, 2026 08:3428,761959,976,242936,223,00012,922,0002,113,536
3May 16, 2026 08:3428,768959,762,155936,487,00012,871,0002,113,536
4May 16, 2026 08:3428,815961,896,109938,034,00012,871,0002,113,536
5May 16, 2026 08:3428,826960,128,508938,376,00012,888,0002,113,536
6May 16, 2026 08:3428,830962,019,526938,483,00012,920,0002,113,536
7May 16, 2026 08:3428,894962,664,812938,299,00015,232,0002,113,536
8May 16, 2026 08:3429,689991,651,518966,608,00013,152,0002,113,536
9May 16, 2026 08:3429,975999,962,534975,620,00013,559,0002,113,536