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 25, 2026 14:03olliecrowolliecrowScore: 6,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 14:045,965178,966,950432,129,00010,026,0002,453,504
2Apr 25, 2026 14:046,029180,879,731446,071,00010,001,0002,502,656
3Apr 25, 2026 14:046,068182,040,676434,242,00010,028,0002,686,976
4Apr 25, 2026 14:046,070182,111,157444,332,00010,983,0002,736,128
5Apr 25, 2026 14:046,098182,946,228441,738,00010,016,0002,560,000
6Apr 25, 2026 14:046,119183,583,859443,701,0008,993,0002,580,480
7Apr 25, 2026 14:046,129183,874,512448,263,0008,965,0002,756,608
8Apr 25, 2026 14:046,129183,889,799448,493,0008,989,0002,367,488
9Apr 25, 2026 14:046,226186,795,954447,809,00010,018,0002,674,688