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 31, 2026 05:16Andrew EpsteinAndrew EpsteinScore: 1,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 05:171,59747,919,121112,686,0001,022,0002,494,464stderr
2Oct 31, 2026 05:171,60048,027,851112,972,0001,015,0002,445,312stderr
3Oct 31, 2026 05:171,62048,608,392114,806,0001,128,0002,498,560stderr
4Oct 31, 2026 05:171,62448,736,676115,274,0001,142,0002,469,888stderr
5Oct 31, 2026 05:171,63949,188,540116,441,0001,122,0002,473,984stderr
6Oct 31, 2026 05:171,64149,246,531116,958,0001,018,0002,449,408stderr
7Oct 31, 2026 05:171,65949,798,047118,548,0001,013,0002,465,792stderr
8Oct 31, 2026 05:171,66549,954,419118,880,0001,140,0002,498,560stderr
9Oct 31, 2026 05:171,67750,318,782115,061,0001,289,0002,449,408stderr