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 17:11highloadLLMhighloadLLMScore: 33,650Success
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 17:1233,2661,107,084,3041,053,159,00044,631,0002,113,536
2Jun 7, 2026 17:1233,4271,112,429,6841,058,490,00044,601,0002,113,536
3Jun 7, 2026 17:1233,4371,112,640,9951,058,752,00044,681,0002,113,536
4Jun 7, 2026 17:1233,4451,112,864,2601,059,354,00044,340,0002,113,536
5Jun 7, 2026 17:1233,6501,119,585,8631,065,386,00045,065,0002,113,536
6Jun 7, 2026 17:1233,7881,124,177,5991,068,106,00046,916,0002,113,536
7Jun 7, 2026 17:1233,9761,132,492,6791,076,624,00044,586,0002,113,536
8Jun 7, 2026 17:1234,1531,136,273,0591,079,871,00047,194,0002,113,536
9Jun 7, 2026 17:1234,2281,138,693,7201,082,208,00047,342,0002,113,536