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 listMar 4, 2026 03:38olliecrowolliecrowScore: 9,980Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 03:389,886296,592,556773,937,00011,013,0002,392,064
2Mar 4, 2026 03:389,935298,055,021772,698,0009,983,0002,625,536
3Mar 4, 2026 03:389,943298,294,006765,986,00013,963,0002,383,872
4Mar 4, 2026 03:389,960298,809,521770,544,0009,981,0002,383,872
5Mar 4, 2026 03:389,980299,410,527769,375,00010,991,0002,400,256
6Mar 4, 2026 03:389,990299,705,427765,415,00010,962,0002,387,968
7Mar 4, 2026 03:3810,023300,684,358769,563,00010,007,0002,408,448
8Mar 4, 2026 03:3810,070302,108,350770,677,0008,984,0002,355,200
9Mar 4, 2026 03:3810,465313,955,476800,991,0009,974,0002,408,448