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 listMay 14, 2026 01:12Josu San MartinJosu San MartinScore: 3,383Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 01:133,349119,274,225109,477,0001,058,0002,113,536
2May 14, 2026 01:133,357121,521,465109,765,0001,047,0002,113,536
3May 14, 2026 01:133,365122,404,518110,022,0001,047,0002,113,536
4May 14, 2026 01:133,370122,057,839110,195,0001,047,0002,113,536
5May 14, 2026 01:133,383120,478,862110,625,0001,037,0002,113,536
6May 14, 2026 01:133,383123,291,589110,594,0001,060,0002,113,536
7May 14, 2026 01:133,392121,549,504110,903,0001,046,0002,113,536
8May 14, 2026 01:133,396122,177,576111,023,0001,053,0002,113,536
9May 14, 2026 01:133,454125,899,794112,952,0001,056,0002,113,536