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 listAug 14, 2026 20:03Tomislav TunkovicTomislav TunkovicScore: 3,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 20:173,06992,090,822233,226,00012,968,0002,166,784stderr
2Aug 14, 2026 20:173,07392,205,448236,331,00012,668,0002,166,784stderr
3Aug 14, 2026 20:173,08192,448,919236,665,00012,670,0002,166,784stderr
4Aug 14, 2026 20:173,08892,640,473235,078,00013,124,0002,166,784stderr
5Aug 14, 2026 20:173,10093,010,497238,597,00013,161,0002,166,784stderr
6Aug 14, 2026 20:173,10893,242,738237,748,00012,153,0002,166,784stderr
7Aug 14, 2026 20:173,11693,509,975238,085,00012,672,0002,166,784stderr
8Aug 14, 2026 20:173,382101,464,521237,630,00012,812,0002,166,784stderr
9Aug 14, 2026 20:173,593107,807,526258,182,00012,789,0002,154,496stderr