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 listOct 25, 2026 06:29Nao MinamiNao MinamiScore: 19,123Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 06:3018,902634,821,286603,447,00020,329,0002,113,536
2Oct 25, 2026 06:3018,918635,407,577603,712,00020,594,0002,113,536
3Oct 25, 2026 06:3019,055640,038,459608,436,00020,379,0002,113,536
4Oct 25, 2026 06:3019,062640,098,042608,305,00020,746,0002,113,536
5Oct 25, 2026 06:3019,123642,178,639610,311,00020,772,0002,113,536
6Oct 25, 2026 06:3019,312648,338,958616,556,00020,771,0002,113,536
7Oct 25, 2026 06:3019,434652,317,079620,521,00020,813,0002,113,536
8Oct 25, 2026 06:3019,492654,130,668622,598,00020,658,0002,113,536
9Oct 25, 2026 06:3020,140675,720,715643,938,00020,708,0002,113,536