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 listOct 24, 2026 19:47janwwwjanwwwScore: 5,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 19:495,117153,510,963414,135,0003,178,0002,170,880
2Oct 24, 2026 19:495,117153,535,811415,084,0003,227,0002,170,880
3Oct 24, 2026 19:495,149154,495,452420,900,0003,185,0002,170,880
4Oct 24, 2026 19:495,150154,509,650421,384,0003,175,0002,170,880
5Oct 24, 2026 19:495,168155,060,758417,699,0003,134,0002,170,880
6Oct 24, 2026 19:495,193155,810,850420,344,0003,162,0002,170,880
7Oct 24, 2026 19:495,197155,921,870423,982,0003,201,0002,170,880
8Oct 24, 2026 19:495,208156,242,772420,262,0003,209,0002,170,880
9Oct 24, 2026 19:495,225156,755,207423,482,0003,219,0002,170,880