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 22, 2026 00:54olliecrowolliecrowScore: 6,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 00:576,779203,381,638530,119,0008,985,0002,502,656
2Apr 22, 2026 00:576,798203,952,330526,868,0008,980,0002,662,400
3Apr 22, 2026 00:576,863205,916,824526,045,00010,000,0003,018,752
4Apr 22, 2026 00:576,879206,376,070528,482,00010,968,0002,555,904
5Apr 22, 2026 00:576,903207,093,685525,710,0009,975,0002,367,488
6Apr 22, 2026 00:576,925207,759,432526,636,0008,993,0002,682,880
7Apr 22, 2026 00:576,949208,492,140525,570,00010,029,0002,867,200
8Apr 22, 2026 00:577,009210,277,446524,650,00010,012,0003,031,040
9Apr 22, 2026 00:577,011210,353,766528,560,00010,970,0002,789,376