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 20:30anboto1anboto1Score: 13,539Success
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 20:3113,364450,413,931428,393,00012,635,0002,117,632
2Jun 7, 2026 20:3113,485454,429,359431,985,00013,028,0002,117,632
3Jun 7, 2026 20:3113,500454,839,857432,370,00013,138,0002,117,632
4Jun 7, 2026 20:3113,500454,904,575432,733,00012,770,0002,117,632
5Jun 7, 2026 20:3113,539456,283,764433,756,00013,042,0002,117,632
6Jun 7, 2026 20:3113,572457,065,715434,616,00013,287,0002,117,632
7Jun 7, 2026 20:3113,581457,462,142434,869,00013,330,0002,117,632
8Jun 7, 2026 20:3113,594457,912,982435,132,00013,471,0002,117,632
9Jun 7, 2026 20:3113,626459,347,458436,238,00013,430,0002,117,632