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 00:30Victor MerckléVictor MerckléScore: 4,468Success
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 00:344,439133,186,515351,886,0003,590,0002,666,496
2Jun 11, 2026 00:344,460133,805,328352,695,0003,613,0002,666,496
3Jun 11, 2026 00:344,462133,864,213353,510,0003,606,0002,666,496
4Jun 11, 2026 00:344,466133,986,510352,848,0003,603,0002,744,320
5Jun 11, 2026 00:344,468134,057,396353,219,0003,615,0002,666,496
6Jun 11, 2026 00:344,470134,106,746354,089,0003,573,0002,666,496
7Jun 11, 2026 00:344,500135,000,296355,253,0003,606,0002,666,496
8Jun 11, 2026 00:344,508135,241,737354,744,0003,596,0002,666,496
9Jun 11, 2026 00:344,525135,779,809353,689,0003,593,0002,666,496