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 28, 2026 15:42Charles CabergsCharles CabergsScore: 12,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 15:4212,362370,885,7731,032,018,00015,984,0002,961,408
2Apr 28, 2026 15:4212,474374,240,0561,054,156,00010,980,0002,994,176
3Apr 28, 2026 15:4212,491374,751,1061,034,361,00013,991,0002,945,024
4Apr 28, 2026 15:4212,511375,338,8191,036,248,00010,981,0002,686,976
5Apr 28, 2026 15:4212,530375,914,2221,057,291,00016,956,0002,924,544
6Apr 28, 2026 15:4212,538376,162,1281,039,553,0009,986,0002,928,640
7Apr 28, 2026 15:4212,613378,413,9441,056,935,00016,982,0002,887,680
8Apr 28, 2026 15:4212,680380,411,8731,059,043,00014,972,0002,777,088
9Apr 28, 2026 15:4212,734382,030,8151,058,770,00014,968,0002,998,272