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:17TudyMTudyMScore: 25,342Success
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:2025,036845,951,274807,614,00018,604,0002,539,520
2May 3, 2026 19:2025,187847,933,097812,481,00018,697,0002,547,712
3May 3, 2026 19:2025,212848,169,575813,973,00018,039,0002,539,520
4May 3, 2026 19:2025,310854,753,129816,497,00018,751,0002,543,616
5May 3, 2026 19:2025,342855,396,609817,967,00018,350,0002,547,712
6May 3, 2026 19:2025,373852,699,313819,109,00018,230,0002,535,424
7May 3, 2026 19:2025,378855,779,517819,018,00018,473,0002,539,520
8May 3, 2026 19:2025,775866,391,326831,977,00018,606,0002,539,520
9May 3, 2026 19:2026,646898,047,707860,787,00018,547,0002,539,520