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 21:08TudyMTudyMScore: 25,764Success
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 21:1125,471858,983,348822,336,00018,210,0002,539,520
2May 3, 2026 21:1125,583862,354,556825,943,00018,297,0002,535,424
3May 3, 2026 21:1125,635864,208,878827,948,00018,029,0002,527,232
4May 3, 2026 21:1125,699864,798,966829,907,00018,181,0002,543,616
5May 3, 2026 21:1125,764866,656,331832,118,00018,117,0002,539,520
6May 3, 2026 21:1126,214880,993,439846,922,00018,160,0002,543,616
7May 3, 2026 21:1126,243886,364,056848,369,00017,671,0002,539,520
8May 3, 2026 21:1126,374902,121,757852,357,00018,009,0002,314,240
9May 3, 2026 21:1126,394890,183,340853,112,00017,899,0002,531,328