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 listApr 1, 2026 14:43olliecrowolliecrowScore: 24,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 14:4324,172823,635,537780,696,00016,971,0002,433,024
2Apr 1, 2026 14:4324,218828,900,471780,199,00018,980,0002,433,024
3Apr 1, 2026 14:4324,413836,555,873787,649,00017,969,0002,359,296
4Apr 1, 2026 14:4324,413837,767,076784,659,00020,964,0002,433,024
5Apr 1, 2026 14:4324,489839,202,379791,158,00016,981,0002,437,120
6Apr 1, 2026 14:4324,591837,759,117789,543,00021,959,0002,441,216