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 22, 2026 00:13olliecrowolliecrowScore: 16,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 00:1616,045481,356,3901,369,856,00025,997,0002,736,128
2Apr 22, 2026 00:1616,087482,636,7061,363,337,00035,008,0002,576,384
3Apr 22, 2026 00:1616,150484,512,1521,369,131,00029,002,0002,416,640
4Apr 22, 2026 00:1616,209486,278,0911,368,771,00033,994,0002,621,440
5Apr 22, 2026 00:1616,228486,868,4911,370,302,00029,006,0002,641,920
6Apr 22, 2026 00:1616,400492,008,0061,371,009,00024,000,0002,674,688
7Apr 22, 2026 00:1616,517495,510,5261,366,486,00033,987,0002,678,784
8Apr 22, 2026 00:1616,816504,503,3381,435,496,00029,989,0002,953,216
9Apr 22, 2026 00:1616,842505,279,9881,438,318,00026,987,0002,682,880