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 16:56anboto1anboto1Score: 29,341Success
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 16:5728,992966,626,767950,117,0006,641,0002,113,536
2Jun 7, 2026 16:5729,051968,382,380951,975,0006,717,0002,113,536
3Jun 7, 2026 16:5729,145971,600,105955,075,0006,739,0002,113,536
4Jun 7, 2026 16:5729,264975,072,042959,073,0006,668,0002,113,536
5Jun 7, 2026 16:5729,341977,655,755961,604,0006,661,0002,113,536
6Jun 7, 2026 16:5729,490982,572,911966,398,0006,777,0002,113,536
7Jun 7, 2026 16:5731,3041,042,742,9001,026,209,0006,837,0002,113,536
8Jun 7, 2026 16:5731,4691,047,807,9941,031,644,0006,848,0002,113,536
9Jun 7, 2026 16:5731,5531,050,890,2921,034,417,0006,852,0002,113,536