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 02:00olliecrowolliecrowScore: 10,516Success
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 02:0010,234307,033,996792,650,0005,997,0002,715,648
2Mar 4, 2026 02:0010,237307,121,894787,382,0006,002,0002,441,216
3Mar 4, 2026 02:0010,289308,676,974792,024,0006,007,0002,433,024
4Mar 4, 2026 02:0010,344310,324,679791,909,0006,999,0002,441,216
5Mar 4, 2026 02:0010,516315,480,233823,857,0006,990,0002,404,352
6Mar 4, 2026 02:0010,590317,689,723796,663,0007,005,0002,809,856
7Mar 4, 2026 02:0010,692320,759,231836,342,0005,995,0002,347,008
8Mar 4, 2026 02:0010,804324,123,138835,917,0006,999,0002,506,752
9Mar 4, 2026 02:0010,815324,443,967837,504,0005,996,0002,424,832