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 listJan 31, 2026 17:16olliecrowolliecrowScore: 21,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 17:1621,044721,816,039681,462,00012,989,0002,379,776
2Jan 31, 2026 17:1621,087719,398,878685,867,0009,998,0002,392,064
3Jan 31, 2026 17:1621,132722,180,995685,368,00011,988,0002,281,472
4Jan 31, 2026 17:1621,203724,314,362685,690,00013,993,0002,301,952
5Jan 31, 2026 17:1621,233725,712,928686,710,00013,994,0002,293,760
6Jan 31, 2026 17:1621,267728,634,595689,810,00011,996,0002,289,664
7Jan 31, 2026 17:1621,287728,609,541690,489,00011,991,0002,281,472
8Jan 31, 2026 17:1621,532735,546,578699,568,00010,993,0002,281,472
9Jan 31, 2026 17:1621,688745,465,253701,740,00013,974,0002,306,048