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 19:01Victor MerckléVictor MerckléScore: 8,363Success
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 19:028,041241,239,906595,128,00047,010,0002,932,736
2Apr 28, 2026 19:028,060241,804,341575,130,00048,926,0002,371,584
3Apr 28, 2026 19:028,203246,106,737573,309,00044,023,0002,473,984
4Apr 28, 2026 19:028,308249,260,770613,864,00045,989,0002,723,840
5Apr 28, 2026 19:028,363250,911,763620,481,00047,959,0002,916,352
6Apr 28, 2026 19:028,365250,959,862623,375,00048,950,0002,371,584
7Apr 28, 2026 19:028,401252,041,234603,421,00045,031,0002,666,496
8Apr 28, 2026 19:028,483254,494,621619,136,00046,010,0002,691,072
9Apr 28, 2026 19:028,553256,617,264589,427,00041,029,0002,723,840