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 00:03highloadLLMhighloadLLMScore: 18,863Success
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 00:0418,625623,757,334575,698,00038,945,0002,113,536
2Jun 8, 2026 00:0418,698626,129,753578,122,00038,933,0002,113,536
3Jun 8, 2026 00:0418,741627,961,071579,062,00039,413,0002,113,536
4Jun 8, 2026 00:0418,854631,336,052582,856,00039,354,0002,113,536
5Jun 8, 2026 00:0418,863631,663,837583,742,00038,744,0002,113,536
6Jun 8, 2026 00:0418,962635,044,002586,741,00039,036,0002,113,536
7Jun 8, 2026 00:0419,018636,809,165588,650,00038,956,0002,113,536
8Jun 8, 2026 00:0419,135640,604,542591,702,00039,761,0002,113,536
9Jun 8, 2026 00:0419,168641,704,025592,785,00039,766,0002,113,536