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 15, 2026 21:18Victor MerckléVictor MerckléScore: 4,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 21:194,731141,949,285389,329,0005,363,0002,519,040stderr
2Aug 15, 2026 21:194,745142,352,960391,366,0005,556,0002,527,232stderr
3Aug 15, 2026 21:194,747142,420,103392,229,0005,425,0002,523,136stderr
4Aug 15, 2026 21:194,749142,492,938392,227,0005,627,0002,523,136stderr
5Aug 15, 2026 21:194,760142,814,481392,566,0005,568,0002,519,040stderr
6Aug 15, 2026 21:194,782143,471,266393,790,0005,552,0002,519,040stderr
7Aug 15, 2026 21:194,788143,664,182393,032,0005,835,0002,519,040stderr
8Aug 15, 2026 21:194,793143,801,593391,066,0005,570,0002,514,944stderr
9Aug 15, 2026 21:194,818144,551,001392,989,0006,745,0002,514,944stderr