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 19, 2026 01:07highload-churnerhighload-churnerScore: 1,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 01:101,63449,030,809112,724,0003,758,000462,848
2Oct 19, 2026 01:101,64249,280,290113,721,0003,757,000221,184
3Oct 19, 2026 01:101,66549,974,079115,712,0003,934,000249,856
4Oct 19, 2026 01:101,68550,562,940117,299,0003,759,000319,488
5Oct 19, 2026 01:101,69950,988,615118,284,0003,936,000217,088
6Oct 19, 2026 01:101,74152,258,828121,103,0004,685,000315,392
7Oct 19, 2026 01:101,77153,131,700119,902,0003,493,000262,144
8Oct 19, 2026 01:101,78953,689,888125,845,0003,496,000262,144
9Oct 19, 2026 01:101,81854,560,336127,985,0004,743,000311,296