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 8, 2026 03:15olliecrowolliecrowScore: 9,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2026 03:159,591287,731,709696,771,00023,058,0002,621,440
2Apr 7, 2026 02:109,749292,471,367708,221,00022,006,0002,453,504
3Apr 7, 2026 02:109,755292,637,488708,228,00023,973,0002,748,416
4Apr 7, 2026 02:109,804294,128,320716,642,00022,019,0002,686,976
5Apr 8, 2026 03:159,938298,135,888712,609,00019,961,0002,781,184
6Apr 8, 2026 03:1510,084302,510,526712,353,00022,010,0002,580,480