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 18:54Victor MerckléVictor MerckléScore: 8,708Success
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 18:567,969239,098,146594,400,00045,953,0002,502,656
2Apr 28, 2026 18:568,138244,167,578587,363,00042,953,0002,678,784
3Apr 28, 2026 18:568,363250,907,937586,797,00043,910,0002,662,400
4Apr 28, 2026 18:568,461253,851,772622,112,00047,931,0002,920,448
5Apr 28, 2026 18:568,708261,267,915629,647,00051,970,0002,662,400
6Apr 28, 2026 18:5610,749322,488,699603,965,00033,941,0002,539,520
7Apr 28, 2026 18:5612,371371,145,975620,374,00030,918,0002,359,296
8Apr 28, 2026 18:5612,804384,149,649648,160,00034,008,0002,375,680
9Apr 28, 2026 18:5612,966388,994,515620,214,00033,418,0002,351,104