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 26, 2026 18:11TudyMTudyMScore: 20,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 18:1219,445583,350,5971,481,658,00066,984,0002,867,200
2Apr 26, 2026 18:1219,553586,600,6911,497,420,00063,975,0002,813,952
3Apr 26, 2026 18:1219,607588,237,2051,481,792,00065,946,0002,686,976
4Apr 26, 2026 18:1219,725591,750,5281,503,844,00069,992,0002,719,744
5Apr 26, 2026 18:1220,304609,138,1701,565,668,00068,897,0002,420,736
6Apr 26, 2026 18:1220,492614,767,9461,573,503,00060,864,0002,318,336
7Apr 26, 2026 18:1220,766622,981,4491,592,120,00063,924,0002,703,360
8Apr 26, 2026 18:1220,840625,204,1241,610,430,00070,886,0002,826,240
9Apr 26, 2026 18:1220,871626,150,6821,615,682,00065,864,0002,678,784