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 7, 2026 02:14olliecrowolliecrowScore: 7,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 7, 2026 02:066,890206,689,061504,820,00012,995,0002,654,208
2Apr 7, 2026 02:146,941208,231,598504,170,00013,004,0002,379,776
3Apr 7, 2026 02:066,978209,339,493503,986,00011,975,0002,396,160
4Apr 7, 2026 02:147,010210,304,075505,720,00012,017,0002,605,056
5Apr 7, 2026 02:067,184215,505,048505,364,00014,010,0002,715,648
6Apr 7, 2026 02:147,206216,185,598508,078,00010,001,0002,383,872