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 listMar 22, 2026 09:36olliecrowolliecrowScore: 9,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 09:369,723348,313,707280,872,00039,981,0002,420,736
2Mar 22, 2026 09:309,746344,054,429276,661,00044,944,0002,412,544
3Mar 22, 2026 09:309,751348,508,081281,799,00039,971,0002,519,040
4Mar 22, 2026 09:309,751342,175,648286,799,00034,975,0002,506,752
5Mar 22, 2026 09:369,767353,981,670285,274,00037,035,0002,347,008
6Mar 22, 2026 09:369,789346,283,276276,043,00047,007,0002,408,448