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 01:17anboto1anboto1Score: 9,817Success
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 01:189,614326,633,902305,240,00012,040,0002,117,632
2Jun 8, 2026 01:189,623326,931,439304,959,00012,602,0002,117,632
3Jun 8, 2026 01:189,732330,474,441308,516,00012,660,0002,117,632
4Jun 8, 2026 01:189,804332,844,893310,850,00012,687,0002,117,632
5Jun 8, 2026 01:189,817333,793,050311,873,00012,090,0002,117,632
6Jun 8, 2026 01:189,818333,329,109311,293,00012,717,0002,117,632
7Jun 8, 2026 01:189,887335,506,409314,218,00012,063,0002,117,632
8Jun 8, 2026 01:189,932337,028,754314,995,00012,788,0002,117,632
9Jun 8, 2026 01:189,980339,003,747317,172,00012,197,0002,117,632