Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 listJun 11, 2026 14:31Victor MerckléVictor MerckléScore: 3,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 14:323,06992,071,999240,108,0003,012,0002,654,208
2Jun 11, 2026 14:323,07992,382,076241,657,0003,146,0002,650,112
3Jun 11, 2026 14:323,08192,442,413240,796,0003,172,0002,654,208
4Jun 11, 2026 14:323,09292,780,057240,768,0003,164,0002,650,112
5Jun 11, 2026 14:323,09592,872,926244,658,0001,019,0002,654,208
6Jun 11, 2026 14:323,09692,897,062241,967,0003,091,0002,654,208
7Jun 11, 2026 14:323,11993,576,877245,415,0001,012,0002,650,112
8Jun 11, 2026 14:323,13494,037,899244,075,0003,148,0002,654,208
9Jun 11, 2026 14:323,17995,383,020243,489,0003,108,0002,654,208