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 20:48TudyMTudyMScore: 26,010Success
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 20:5225,443856,010,510821,607,00018,015,0002,539,520
2May 3, 2026 20:5225,601862,101,488826,389,00018,449,0002,531,328
3May 3, 2026 20:5225,613866,479,787826,937,00018,292,0002,527,232
4May 3, 2026 20:5225,787869,107,803832,646,00018,350,0002,539,520
5May 3, 2026 20:5226,010878,133,483839,849,00018,509,0002,535,424
6May 3, 2026 20:5226,119879,427,013843,884,00018,070,0002,531,328
7May 3, 2026 20:5226,216884,377,535847,049,00018,090,0002,535,424
8May 3, 2026 20:5226,222884,733,810847,561,00017,774,0002,531,328
9May 3, 2026 20:5226,352886,963,562851,600,00018,031,0002,535,424