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:12TudyMTudyMScore: 25,056Success
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:1624,836836,394,351801,549,00018,055,0002,539,520
2May 3, 2026 19:1624,945839,056,619804,719,00018,478,0002,535,424
3May 3, 2026 19:1624,960840,535,230805,240,00018,454,0002,539,520
4May 3, 2026 19:1625,015840,305,296807,160,00018,338,0002,547,712
5May 3, 2026 19:1625,056844,348,005807,598,00019,263,0002,535,424
6May 3, 2026 19:1625,064843,009,888808,493,00018,628,0002,535,424
7May 3, 2026 19:1625,244852,325,095814,060,00019,007,0002,543,616
8May 3, 2026 19:1625,350852,592,385817,944,00018,617,0002,531,328
9May 3, 2026 19:1625,449855,352,333820,436,00019,389,0002,539,520