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 3, 2026 19:37TudyMTudyMScore: 24,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 19:4124,674827,966,230795,877,00018,389,0002,527,232
2May 3, 2026 19:4124,686833,499,473796,410,00018,249,0002,543,616
3May 3, 2026 19:4124,860838,837,439802,216,00018,165,0002,539,520
4May 3, 2026 19:4124,905839,700,511803,356,00018,536,0002,535,424
5May 3, 2026 19:4124,942840,074,958804,902,00018,210,0002,543,616
6May 3, 2026 19:4125,274851,419,614815,227,00018,830,0002,543,616
7May 3, 2026 19:4125,359855,748,158817,451,00019,402,0002,555,904
8May 3, 2026 19:4125,360853,851,195817,900,00019,012,0002,535,424
9May 3, 2026 19:4125,446856,928,748821,013,00018,735,0002,539,520