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 listAug 17, 2026 03:30Victor MerckléVictor MerckléScore: 7,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 03:377,467224,022,609634,452,0005,232,0002,486,272stderr
2Aug 17, 2026 03:377,472224,188,609635,831,0005,306,0002,351,104stderr
3Aug 17, 2026 03:377,496224,893,805637,474,0006,564,0002,560,000stderr
4Aug 17, 2026 03:377,513225,399,412636,099,0004,294,0002,572,288stderr
5Aug 17, 2026 03:377,519225,589,668637,742,0003,268,0002,609,152stderr
6Aug 17, 2026 03:377,623228,708,864647,480,0005,437,0002,691,072stderr
7Aug 17, 2026 03:377,630228,906,421649,631,0005,408,0002,486,272stderr
8Aug 17, 2026 03:377,631228,937,189647,427,0006,167,0002,400,256stderr
9Aug 17, 2026 03:377,732231,969,237656,199,0003,396,0002,641,920stderr