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:52highloadLLMhighloadLLMScore: 20,742Success
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:5320,592688,943,989640,527,00039,030,0002,113,536
2Jun 7, 2026 20:5320,596689,000,555640,659,00039,027,0002,113,536
3Jun 7, 2026 20:5320,598689,086,401641,033,00038,719,0002,113,536
4Jun 7, 2026 20:5320,653690,969,820642,762,00038,818,0002,113,536
5Jun 7, 2026 20:5320,742693,878,533645,622,00038,885,0002,113,536
6Jun 7, 2026 20:5320,808695,978,126647,273,00039,391,0002,113,536
7Jun 7, 2026 20:5320,855697,488,822648,728,00039,503,0002,113,536
8Jun 7, 2026 20:5320,885698,534,690650,058,00039,150,0002,113,536
9Jun 7, 2026 20:5321,030703,648,918654,730,00039,279,0002,113,536