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 28, 2026 17:16Victor MerckléVictor MerckléScore: 5,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 17:175,592167,761,065431,772,00010,994,0002,846,720
2Apr 28, 2026 17:175,687170,639,502426,867,00014,995,0002,613,248
3Apr 28, 2026 17:175,703171,113,652429,287,00011,033,0002,682,880
4Apr 28, 2026 17:175,745172,370,462433,326,00010,030,0002,621,440
5Apr 28, 2026 17:175,751172,556,694431,758,00012,021,0002,682,880
6Apr 28, 2026 17:175,827174,818,401430,769,00014,957,0002,805,760
7Apr 28, 2026 17:175,879176,383,809429,099,00015,003,0002,650,112
8Apr 28, 2026 17:175,895176,877,251430,618,00013,987,0002,846,720
9Apr 28, 2026 17:175,925177,767,649429,906,00014,996,0002,854,912