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:58olliecrowolliecrowScore: 6,244Success
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:596,133184,017,179468,571,0008,991,0002,539,520
2Apr 22, 2026 00:596,152184,589,982465,774,0008,995,0002,854,912
3Apr 22, 2026 00:596,202186,067,570464,595,00010,012,0002,781,184
4Apr 22, 2026 00:596,237187,116,287464,580,0009,990,0002,822,144
5Apr 22, 2026 00:596,244187,325,793464,160,0009,981,0003,031,040
6Apr 22, 2026 00:596,307189,223,133474,431,0008,970,0002,756,608
7Apr 22, 2026 00:596,327189,835,562464,647,00010,968,0002,588,672
8Apr 22, 2026 00:596,376191,287,615474,457,0008,970,0002,547,712
9Apr 22, 2026 00:596,424192,746,516471,695,00010,969,0002,576,384