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:51Victor MerckléVictor MerckléScore: 6,937Success
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:526,765202,978,649490,918,00041,907,0002,752,512
2Apr 28, 2026 17:526,808204,255,989479,383,00048,937,0002,605,056
3Apr 28, 2026 17:526,898206,946,580483,049,00041,004,0002,703,360
4Apr 28, 2026 17:526,903207,119,662483,354,00042,030,0002,809,856
5Apr 28, 2026 17:526,937208,130,754489,919,00038,071,0002,793,472
6Apr 28, 2026 17:526,954208,645,152491,154,00047,014,0002,625,536
7Apr 28, 2026 17:526,957208,739,209488,681,00044,061,0002,572,288
8Apr 28, 2026 17:527,000210,027,214485,232,00044,021,0002,703,360
9Apr 28, 2026 17:527,183215,493,059488,062,00044,639,0002,740,224