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:51Victor MerckléVictor MerckléScore: 3,142Success
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:523,11793,525,869245,540,0003,150,0002,654,208
2Jun 11, 2026 14:523,13193,945,052243,052,0003,160,0002,654,208
3Jun 11, 2026 14:523,13494,027,761247,592,0001,008,0002,650,112
4Jun 11, 2026 14:523,13594,052,084245,095,0003,133,0002,654,208
5Jun 11, 2026 14:523,14294,273,475242,226,0003,140,0002,654,208
6Jun 11, 2026 14:523,15994,780,095246,180,0003,117,0002,654,208
7Jun 11, 2026 14:523,15994,781,700247,289,0003,108,0002,650,112
8Jun 11, 2026 14:523,17495,241,333245,976,0003,189,0002,650,112
9Jun 11, 2026 14:523,20996,272,498246,726,0003,072,0002,654,208