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 23:09anboto1anboto1Score: 11,621Success
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 23:1111,556391,157,240369,304,00012,062,0002,117,632
2Jun 7, 2026 23:1111,588392,123,089370,299,00012,126,0002,117,632
3Jun 7, 2026 23:1111,596392,398,934370,498,00012,174,0002,117,632
4Jun 7, 2026 23:1111,602392,206,592370,781,00012,105,0002,117,632
5Jun 7, 2026 23:1111,621392,786,246371,358,00012,155,0002,117,632
6Jun 7, 2026 23:1111,648394,156,275372,161,00012,241,0002,117,632
7Jun 7, 2026 23:1111,670394,383,875372,891,00012,235,0002,117,632
8Jun 7, 2026 23:1111,698395,282,348373,890,00012,149,0002,117,632
9Jun 7, 2026 23:1111,828399,901,291378,077,00012,258,0002,117,632