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 3, 2025 23:52Martin StensgårdMartin StensgårdScore: 259,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2025 23:52258,4298,564,816,2938,515,181,00012,981,0002,301,952
2Oct 3, 2025 23:52259,0158,583,403,6638,540,514,0006,990,0002,482,176
3Oct 3, 2025 23:52259,1518,593,393,3658,545,995,0005,991,0002,408,448
4Oct 3, 2025 23:52259,2128,590,976,0368,541,004,00012,983,0002,310,144
5Oct 3, 2025 23:52259,8938,616,073,5008,570,494,0005,991,0002,301,952
6Oct 3, 2025 23:52261,5068,669,782,6478,621,719,0007,988,0002,510,848
7Oct 3, 2025 23:52261,6478,674,297,2148,625,361,0008,985,0002,289,664
8Oct 3, 2025 23:52268,0488,887,246,0718,835,588,0009,983,0002,301,952
9Oct 3, 2025 23:52268,1138,885,855,2198,838,748,0008,986,0002,408,448