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 listApr 27, 2026 13:30Victor MerckléVictor MerckléScore: 37,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 13:3136,9091,107,282,6503,042,640,00062,951,0002,580,480
2Apr 27, 2026 13:3136,9891,109,691,2463,048,187,00046,956,0002,760,704
3Apr 27, 2026 13:3137,0781,112,353,7203,044,406,00055,952,0002,527,232
4Apr 27, 2026 13:3137,1351,114,055,2143,047,812,00053,961,0002,617,344
5Apr 27, 2026 13:3137,3351,120,071,6593,086,858,00056,923,0002,568,192
6Apr 27, 2026 13:3137,4761,124,286,9243,088,822,00054,925,0002,621,440
7Apr 27, 2026 13:3137,4851,124,570,6603,088,868,00054,962,0002,834,432
8Apr 27, 2026 13:3137,4961,124,897,2063,095,301,00048,941,0002,707,456
9Apr 27, 2026 13:3138,1851,145,579,2963,056,048,00052,948,0002,793,472