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 28, 2026 02:03Victor MerckléVictor MerckléScore: 3,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 02:073,00890,253,678232,324,0003,691,0002,670,592
2Jun 28, 2026 02:073,02690,788,866234,518,0003,466,0002,670,592
3Jun 28, 2026 02:073,05291,576,165236,267,0003,393,0002,674,688
4Jun 28, 2026 02:073,05691,708,096236,758,0003,703,0002,674,688
5Jun 28, 2026 02:073,05991,771,611237,023,0003,647,0002,678,784
6Jun 28, 2026 02:073,06892,043,091237,146,0003,409,0002,674,688
7Jun 28, 2026 02:073,07292,185,899237,656,0003,656,0002,674,688
8Jun 28, 2026 02:073,07592,250,332238,037,0003,637,0002,674,688
9Jun 28, 2026 02:073,11493,428,998242,255,0003,653,0002,433,024