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 31, 2026 00:38Andrew EpsteinAndrew EpsteinScore: 2,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 00:392,65396,984,52286,533,0001,035,0002,117,632
2Oct 31, 2026 00:392,66397,433,05286,596,0001,290,0002,117,632
3Oct 31, 2026 00:392,66697,393,25786,721,0001,264,0002,117,632
4Oct 31, 2026 00:392,67197,589,03587,127,0001,026,0002,117,632
5Oct 31, 2026 00:392,68898,121,74887,705,0001,009,0002,117,632
6Oct 31, 2026 00:392,69198,220,89587,560,0001,274,0002,117,632
7Oct 31, 2026 00:392,69298,263,43287,850,0001,017,0002,117,632
8Oct 31, 2026 00:392,69498,215,01187,628,0001,278,0002,117,632
9Oct 31, 2026 00:392,71498,930,48188,290,0001,284,0002,117,632