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:33olliecrowolliecrowScore: 32,826Success
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:3824,163825,818,710774,426,00022,953,0002,433,024
2Apr 1, 2026 14:3824,183827,286,798780,077,00017,978,0002,433,024
3Apr 1, 2026 14:3824,462838,812,052786,303,00020,954,0002,338,816
4Apr 1, 2026 14:3332,8261,115,190,5801,063,256,00019,986,0002,318,336
5Apr 1, 2026 14:3332,9181,111,529,3811,063,304,00022,984,0002,359,296
6Apr 1, 2026 14:3335,5691,202,217,9541,153,804,00019,979,0002,322,432