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 15:27Victor MerckléVictor MerckléScore: 3,132Success
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 15:283,07892,365,143240,062,0003,140,0002,654,208
2Jun 11, 2026 15:283,09992,985,650241,959,0003,113,0002,654,208
3Jun 11, 2026 15:283,10693,185,440243,497,0003,117,0002,654,208
4Jun 11, 2026 15:283,12393,704,285246,149,0001,024,0002,650,112
5Jun 11, 2026 15:283,13293,980,373243,079,0003,062,0002,650,112
6Jun 11, 2026 15:283,13994,191,445245,551,0001,011,0002,654,208
7Jun 11, 2026 15:283,18195,430,350250,346,0001,015,0002,654,208
8Jun 11, 2026 15:283,19995,983,079249,193,0002,057,0002,654,208
9Jun 11, 2026 15:283,20496,133,695246,976,0003,081,0002,654,208