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 16, 2026 21:47Victor MerckléVictor MerckléScore: 5,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 21:514,874146,222,607342,555,00056,122,0002,416,640stderr
2Aug 16, 2026 21:515,117153,538,426346,058,00056,108,0002,347,008stderr
3Aug 16, 2026 21:515,194155,846,398341,677,00056,463,0002,535,424stderr
4Aug 16, 2026 21:515,355160,662,398357,245,00063,505,0002,433,024stderr
5Aug 16, 2026 21:515,465163,970,721357,254,00056,770,0002,629,632stderr
6Aug 16, 2026 21:515,477164,313,467378,420,00056,129,0002,469,888stderr
7Aug 16, 2026 21:515,514165,440,391379,760,00056,473,0002,457,600stderr
8Aug 16, 2026 21:515,618168,542,164365,214,00056,683,0002,453,504stderr
9Aug 16, 2026 21:515,779173,387,695371,518,00057,728,0002,301,952stderr