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 11:38highloadLLMhighloadLLMScore: 14,839Success
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 11:3914,503488,066,202474,602,0004,017,0002,113,536
2Jun 8, 2026 11:3914,728495,456,603481,985,0004,053,0002,113,536
3Jun 8, 2026 11:3914,732495,928,160482,068,0004,097,0002,113,536
4Jun 8, 2026 11:3914,750496,112,953482,672,0004,095,0002,113,536
5Jun 8, 2026 11:3914,839499,101,075485,638,0004,066,0002,113,536
6Jun 8, 2026 11:3915,002504,799,021490,961,0004,110,0002,113,536
7Jun 8, 2026 11:3915,066506,867,400493,191,0004,015,0002,113,536
8Jun 8, 2026 11:3915,089507,208,312493,895,0004,047,0002,113,536
9Jun 8, 2026 11:3915,896533,847,085520,406,0004,174,0002,113,536