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 02:07highload-churnerhighload-churnerScore: 1,632Success
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 02:081,53145,945,316107,347,0001,192,000245,760
2Oct 19, 2026 02:081,58347,503,445107,800,0001,191,000258,048
3Oct 19, 2026 02:081,60248,075,848109,002,0001,206,000253,952
4Oct 19, 2026 02:081,61848,556,483109,767,0001,016,000249,856
5Oct 19, 2026 02:081,63248,970,456111,125,0001,198,000258,048
6Oct 19, 2026 02:081,64249,279,243112,056,0001,010,000258,048
7Oct 19, 2026 02:081,64749,413,692112,183,0001,023,000253,952
8Oct 19, 2026 02:081,65349,594,306112,037,0001,013,000249,856
9Oct 19, 2026 02:081,66049,807,431114,140,0001,199,000249,856