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:42TudyMTudyMScore: 25,788Success
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:4625,690864,722,829829,642,00018,142,0002,539,520
2May 3, 2026 19:4625,712864,458,478830,240,00018,259,0002,539,520
3May 3, 2026 19:4625,742863,747,248831,154,00018,346,0002,551,808
4May 3, 2026 19:4625,751864,745,101831,570,00018,237,0002,539,520
5May 3, 2026 19:4625,788868,724,142832,587,00018,429,0002,531,328
6May 3, 2026 19:4625,860871,947,326834,718,00018,688,0002,535,424
7May 3, 2026 19:4625,921871,188,054836,929,00018,475,0002,547,712
8May 3, 2026 19:4626,017876,171,285840,273,00018,308,0002,539,520
9May 3, 2026 19:4626,201880,745,975846,504,00018,130,0002,543,616