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 2, 2026 13:18Victor MerckléVictor MerckléScore: 5,666Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 13:195,569167,096,934465,775,0005,489,0002,629,632stderr
2Aug 2, 2026 13:195,583167,495,467465,694,0006,501,0002,629,632stderr
3Aug 2, 2026 13:195,593167,793,810467,224,0005,737,0002,629,632stderr
4Aug 2, 2026 13:195,601168,053,111466,336,0006,935,0002,629,632stderr
5Aug 2, 2026 13:195,666169,990,318469,684,0006,782,0002,629,632stderr
6Aug 2, 2026 13:195,700171,014,440473,862,0006,691,0002,404,352stderr
7Aug 2, 2026 13:195,746172,383,777472,476,0006,966,0002,629,632stderr
8Aug 2, 2026 13:195,754172,620,365481,895,0005,562,0002,629,632stderr
9Aug 2, 2026 13:195,838175,142,256485,159,0006,876,0002,629,632stderr